Computational results with a primal–dual subproblem simplex method
- 1 November 1999
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 25 (4) , 149-157
- https://doi.org/10.1016/s0167-6377(99)00048-6
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOperations Research, 1998
- Airline Crew Scheduling: A New Formulation and Decomposition AlgorithmOperations Research, 1997
- Solving large scale crew scheduling problemsEuropean Journal of Operational Research, 1997
- Solving binary cutting stock problems by column generation and branch-and-boundComputational Optimization and Applications, 1994
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex MethodsOperations Research, 1992
- A global approach to crew-pairing optimizationIBM Systems Journal, 1992
- The pivot and probe algorithm for solving a linear programMathematical Programming, 1984
- Linear Programming and ExtensionsPublished by Walter de Gruyter GmbH ,1963
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961