A dual strategy for solving the linear programming relaxation of a driver scheduling system
From MaRDI portal
Publication:1904740
DOI10.1007/BF02057161zbMath0836.90098MaRDI QIDQ1904740
L. G. Proll, Anthony Wren, W. P. Willers
Publication date: 7 January 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
multiple objectives; dual simplex; driver scheduling system; set covering and partitioning constraints
90C29: Multi-objective and goal programming
90C05: Linear programming
90B35: Deterministic scheduling theory in operations research
Cites Work
- Unnamed Item
- A new approach for crew pairing problems by column generation with an application to air transportation
- On the solution of highly degenerate linear programmes
- A structural Lagrangean relaxation for two-duty period bus driver scheduling problems
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- 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
- Steepest-edge simplex algorithms for linear programming
- Linear Programming on Cray Supercomputers
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- A practicable steepest-edge simplex algorithm
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- An Algorithm for Large Set Partitioning Problems
- A Technique for Resolving Degeneracy in Linear Programming
