Approximating the multi-level bottleneck assignment problem

DOI10.1007/978-3-642-28076-4_9MaRDI QIDQ2889901zbMATHOpenAlexFDO

Authors Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma

Publication date 8 June 2012

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/336714

zbMATH Keywords

computational complexityapproximationefficient algorithmbottleneck problemmultidimensional assignment

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• Approximating the multi-level bottleneck assignment problem
• A multi-level bottleneck assignment approach to the bus drivers' rostering problem
• The Multicommodity Multilevel Bottleneck Assignment Problem
• A heuristic procedure for the crew rostering problem
• Multiple bottleneck assignment problem

Cited in

(9)

• A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
• Bottleneck assignment problems under categorization
• A note on exact algorithms for the bottleneck generalized assignment problem
• Solution methods and computational investigations for the linear bottleneck assignment problem
• scientific article; zbMATH DE number 5524189 (Why is no real title available?)
• Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations
• scientific article; zbMATH DE number 1688388 (Why is no real title available?)
• The Multicommodity Multilevel Bottleneck Assignment Problem
• Approximating the multi-level bottleneck assignment problem

This page was built for publication: Approximating the multi-level bottleneck assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889901)