The Multicommodity Multilevel Bottleneck Assignment Problem

DOI10.1016/j.endm.2004.03.010zbMath1152.05354OpenAlexW2092266240MaRDI QIDQ3439124

Roberto Cordone, Roberto Aringhieri

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)

Related Items (3)

A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern ⋮ Approximating the multi-level bottleneck assignment problem ⋮ A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters

Cites Work

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

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