BoxStep methods for crew pairing problems
From MaRDI portal
Publication:833409
DOI10.1007/s11081-006-6589-yzbMath1176.90248OpenAlexW2018275076MaRDI QIDQ833409
Tran Van Hoai, Gerhard Reinelt, Hans Georg Bock
Publication date: 12 August 2009
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-006-6589-y
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cutting planes and column generation techniques with the projective algorithm
- Stabilized column generation
- A least-squares primal-dual algorithm for solving linear programming problems
- Computational results with a primal-dual subproblem simplex method
- A proximal trust-region algorithm for column generation stabilization
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- The Cutting-Plane Method for Solving Convex Programs
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
This page was built for publication: BoxStep methods for crew pairing problems