Home > Research > Publications & Outputs > Approximating the multi-level bottleneck assign...

Research

Links

Text available via DOI:

Keywords

View graph of relations

Approximating the multi-level bottleneck assignment problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Approximating the multi-level bottleneck assignment problem. / Dokka, Trivikram; Kouvela, Anastasia; Spieksma, Frits C.r.
In: Operations Research Letters, Vol. 40, No. 4, 01.07.2012, p. 282-286.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Dokka, T, Kouvela, A & Spieksma, FCR 2012, 'Approximating the multi-level bottleneck assignment problem', Operations Research Letters, vol. 40, no. 4, pp. 282-286. https://doi.org/10.1016/j.orl.2012.04.003

APA

Dokka, T., Kouvela, A., & Spieksma, F. C. R. (2012). Approximating the multi-level bottleneck assignment problem. Operations Research Letters, 40(4), 282-286. https://doi.org/10.1016/j.orl.2012.04.003

Vancouver

Dokka T, Kouvela A, Spieksma FCR. Approximating the multi-level bottleneck assignment problem. Operations Research Letters. 2012 Jul 1;40(4):282-286. doi: 10.1016/j.orl.2012.04.003

Author

Dokka, Trivikram ; Kouvela, Anastasia ; Spieksma, Frits C.r. / Approximating the multi-level bottleneck assignment problem. In: Operations Research Letters. 2012 ; Vol. 40, No. 4. pp. 282-286.

Bibtex

@article{c7fbe1f56e8842199b3a91ea6d9cbd04,
title = "Approximating the multi-level bottleneck assignment problem",
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 mm-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.",
keywords = "Bottleneck problem, Multidimensional assignment, Approximation, Computational complexity, Efficient algorithm",
author = "Trivikram Dokka and Anastasia Kouvela and Spieksma, {Frits C.r.}",
year = "2012",
month = jul,
day = "1",
doi = "10.1016/j.orl.2012.04.003",
language = "English",
volume = "40",
pages = "282--286",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "4",

}

RIS

TY - JOUR

T1 - Approximating the multi-level bottleneck assignment problem

AU - Dokka, Trivikram

AU - Kouvela, Anastasia

AU - Spieksma, Frits C.r.

PY - 2012/7/1

Y1 - 2012/7/1

N2 - 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 mm-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.

AB - 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 mm-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.

KW - Bottleneck problem

KW - Multidimensional assignment

KW - Approximation

KW - Computational complexity

KW - Efficient algorithm

U2 - 10.1016/j.orl.2012.04.003

DO - 10.1016/j.orl.2012.04.003

M3 - Journal article

VL - 40

SP - 282

EP - 286

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 4

ER -