Approximating the multi-level bottleneck assignment problem

DOI10.1007/978-3-642-28076-4_9zbMATH Open1351.68308OpenAlexW2159070416MaRDI QIDQ2889901FDOQ2889901

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

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

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)

Cited In (9)

• A note on exact algorithms for the bottleneck generalized assignment problem
• The Multicommodity Multilevel Bottleneck Assignment Problem
• A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
• Title not available (Why is that?)
• Solution methods and computational investigations for the linear bottleneck assignment problem
• Bottleneck assignment problems under categorization
• Title not available (Why is that?)
• Approximating the multi-level bottleneck assignment problem
• Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations

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)