• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Complexity of the min-max and min-max regret assignment problems

Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2005), Complexity of the min-max and min-max regret assignment problems, Operations Research Letters, 33, 6, p. 634-640. http://dx.doi.org/10.1016/j.orl.2004.12.002

Type
Article accepté pour publication ou publié
Date
2005
Journal name
Operations Research Letters
Volume
33
Number
6
Publisher
Elsevier
Pages
634-640
Publication identifier
http://dx.doi.org/10.1016/j.orl.2004.12.002
Metadata
Show full item record
Author(s)
Aissi, Hassene
Bazgan, Cristina
Vanderpooten, Daniel
Abstract (EN)
This paper investigates the complexity of the min–max and min–max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min–max regret assignment problem is strongly NP-hard.
Subjects / Keywords
Complexity; NP-hard; Min–max regret; Min–max; Assignment problem

Related items

Showing items related by title and author.

  • Thumbnail
    Complexity of the min-max (regret) versions of cut problems 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2005) Communication / Conférence
  • Thumbnail
    Complexity of the min-max (regret) versions of cut problems 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2008) Article accepté pour publication ou publié
  • Thumbnail
    Approximation of min-max and min-max regret versions of some combinatorial optimization problems 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2007) Article accepté pour publication ou publié
  • Thumbnail
    Min–max and min–max regret versions of combinatorial optimization problems: A survey 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2009) Article accepté pour publication ou publié
  • Thumbnail
    Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack 
    Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel (2005) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo