The Library
On the robust assignment problem under a fixed number of cost scenarios
Tools
Tools
Tools
Deineko, Vladimir G. and Woeginger, Gerhard J. (2006) On the robust assignment problem under a fixed number of cost scenarios. Operations Research Letters, Vol.34 (No.2). pp. 175-179. doi:10.1016/j.orl.2005.04.003
Full text not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1016/j.orl.2005.04.003
Abstract
We investigate the complexity of the min-max assignment problem under a fixed number of scenarios. We prove that this problem is polynomial-time equivalent to the exact perfect matching problem in bipartite graphs. an infamous combinatorial optimization problem of unknown computational complexity. (c) 2005 Published by Elsevier B.V.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management | ||||
| Divisions: | Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences Faculty of Social Sciences > Warwick Business School |
||||
| Journal or Publication Title: | Operations Research Letters | ||||
| Publisher: | Elsevier BV | ||||
| ISSN: | 0167-6377 | ||||
| Official Date: | March 2006 | ||||
| Dates: |
|
||||
| Volume: | Vol.34 | ||||
| Number: | No.2 | ||||
| Number of Pages: | 5 | ||||
| Page Range: | pp. 175-179 | ||||
| DOI: | 10.1016/j.orl.2005.04.003 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access | ||||
| Funder: | Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Netherlands Organisation for Scientific Research] (NWO) | ||||
| Grant number: | 639.033.403 |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
