Computational results with a primal-dual subproblem simplex method
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3918094
- A primal-dual simplex method for linear programs
- Computational aspects of linear programming simplex method
- The volume algorithm: Producing primal solutions with a subgradient method
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- A Linear Programming Approach to the Cutting-Stock Problem
- A global approach to crew-pairing optimization
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- Branch-and-price: Column generation for solving huge integer programs
- Solving binary cutting stock problems by column generation and branch- and-bound
- Solving large scale crew scheduling problems
- The pivot and probe algorithm for solving a linear program
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
Cited in
(8)- A parallel primal-dual simplex algorithm
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
- A new heuristic branching scheme for the crew pairing problem with base constraints
- Airline crew scheduling: state-of-the-art
- BoxStep methods for crew pairing problems
- A dual ascent procedure for the set partitioning problem
- Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
- Primal-dual simplex method for shooting
This page was built for publication: Computational results with a primal-dual subproblem simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969761)
