State space relaxation for set covering problems related to bus driver scheduling

DOI10.1016/0377-2217(93)90056-SzbMath0799.90061OpenAlexW2027920449MaRDI QIDQ1322157

V. Pereyra

Publication date: 17 November 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90056-s

zbMATH Keywords

crew schedulingset coveringlower bound techniquestate space relaxationbus driver scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Boolean programming (90C09)

Related Items (2)

A dynamic programming based algorithm for the crew scheduling problem. ⋮ An improved configuration checking-based algorithm for the unicost set covering problem

Cites Work

• Algorithms for large scale set covering problems
• Computer-aided transit scheduling. Proceedings of the fourth international workshop on computer-aided scheduling of public transport, held in Hamburg, FRG, 28th -- 31st July 1987
• An algorithm for set covering problem
• A Column Generation Approach to the Urban Transit Crew Scheduling Problem
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• State-space relaxation procedures for the computation of bounds to routing problems
• A Survey of Lagrangean Techniques for Discrete Optimization
• Unnamed Item
• Unnamed Item

This page was built for publication: State space relaxation for set covering problems related to bus driver scheduling