Dokka, Trivikram, Kouvela, Anastasia and Spieksma, Frits C.R. (2012) Approximating the multi-level bottleneck assignment problem. Operations Research Letters, 40 (4). pp. 282-286. ISSN 0167-6377
Full text not available from this repository.
Identification Number: 10.1016/j.orl.2012.04.003
Abstract
We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book "Assignment Problems" by Burkard et al. (2009) on pages 188-189, where its complexity status is called open. We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem and settle its complexity status. We give approximation algorithms and inapproximability results, depending upon the completeness of the underlying graph.
| Item Type: | Article |
|---|---|
| Official URL: | http://www.journals.elsevier.com/operations-resear... |
| Additional Information: | © 2012 Elsevier |
| Divisions: | LSE |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 23 May 2012 11:04 |
| Last Modified: | 12 Dec 2024 00:08 |
| URI: | http://eprints.lse.ac.uk/id/eprint/43861 |
Actions (login required)
 |
View Item |
