A parallel primal-dual simplex algorithm
From MaRDI portal
Publication:1591540
DOI10.1016/S0167-6377(00)00017-1zbMath0988.90019OpenAlexW2136241751MaRDI QIDQ1591540
Ellis L. Johnson, Nemhauser, George I., Diego Klabjan
Publication date: 22 July 2002
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(00)00017-1
Related Items (7)
Advances in the Parallelization of the Simplex Method ⋮ Improving airline operational performance through schedule perturbation ⋮ Could we use a million cores to solve an integer program? ⋮ A parallel implementation of the simplex function minimization routine ⋮ A dual ascent procedure for the set partitioning problem ⋮ Towards a practical parallelisation of the simplex method ⋮ Airline crew scheduling: state-of-the-art
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational results with a primal-dual subproblem simplex method
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- A global approach to crew-pairing optimization
- Parallelizing the Dual Simplex Method
- Maximum matching and a polyhedron with 0,1-vertices
This page was built for publication: A parallel primal-dual simplex algorithm