• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Some tractable instances of interval data minmax regret problems

Thumbnail
View/Open
cahierLamsade265-1.pdf (351.8Kb)
Date
2008
Dewey
Recherche opérationnelle
Sujet
Bipartite perfect matching; Spanning tree; Shortest path; Interval data; Robust optimization
Journal issue
Operations Research Letters
Volume
36
Number
4
Publication date
07-2008
Article pages
424-429
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.orl.2007.12.004
URI
https://basepub.dauphine.fr/handle/123456789/3490
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Escoffier, Bruno
Monnot, Jérôme
Spanjaard, Olivier
Type
Article accepté pour publication ou publié
Abstract (EN)
In this paper, we provide polynomial and pseudopolynomial algorithms for classes of particular instances of interval data minmax regret graph problems. These classes are defined using a parameter that measures the distance from well-known solvable instances. Tractable cases occur when the parameter is bounded by a constant.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.