The Multicommodity Multilevel Bottleneck Assignment Problem

DOI10.1016/J.ENDM.2004.03.010MaRDI QIDQ3439124zbMATH OpenOpenAlexFDO

Authors Roberto Aringhieri, Roberto Cordone

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2004.03.010

zbMATH Keywords

bottleneck assignmentcrew rostering

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Approximating the multi-level bottleneck assignment problem
• Approximating the multi-level bottleneck assignment problem
• Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations
• Multiple bottleneck assignment problem
• A note on the complexity of the bilevel bottleneck assignment problem
• The bottleneck generalized assignment problem
• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
• Solving Multicommodity Flow Problems by an Approximation Scheme
• A bottleneck assignment approach to the multiple container loading problem
• Approximation and Online Algorithms

Cites work

• A dynamic programming based algorithm for the crew scheduling problem.
• A multi-level bottleneck assignment approach to the bus drivers' rostering problem
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Modeling and solving the crew rostering problem

Cited in

(7)

• The three-dimensional bottleneck assignment problem with capacity constraints
• Approximating the multi-level bottleneck assignment problem
• A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern
• A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters
• Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations
• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
• Approximating the multi-level bottleneck assignment problem

This page was built for publication: The Multicommodity Multilevel Bottleneck Assignment Problem

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