A parallel primal-dual simplex algorithm
From MaRDI portal
Recommendations
Cites work
- A global approach to crew-pairing optimization
- Branch-and-price: Column generation for solving huge integer programs
- Computational results with a primal-dual subproblem simplex method
- scientific article; zbMATH DE number 3121287 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- Network flows. Theory, algorithms, and applications.
- Parallelizing the Dual Simplex Method
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
Cited in
(12)- Parallelizing the dual revised simplex method
- A new efficient primal dual simplex algorithm
- Could we use a million cores to solve an integer program?
- A parallel implementation of the simplex function minimization routine
- Advances in the parallelization of the simplex method
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- Parallelizing the Dual Simplex Method
- A primal-dual simplex method for linear programs
- Airline crew scheduling: state-of-the-art
- Improving airline operational performance through schedule perturbation
- A dual ascent procedure for the set partitioning problem
- Towards a practical parallelisation of the simplex method
This page was built for publication: A parallel primal-dual simplex algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591540)