Computational results with a primal-dual subproblem simplex method

DOI10.1016/S0167-6377(99)00048-6zbMath0937.90060OpenAlexW2021311903MaRDI QIDQ1969761

Jing Hu, Ellis L. Johnson

Publication date: 14 June 2000

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(99)00048-6

zbMATH Keywords

simplexlinear programming algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (6)

BoxStep methods for crew pairing problems ⋮ A new heuristic branching scheme for the crew pairing problem with base constraints ⋮ Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design ⋮ A dual ascent procedure for the set partitioning problem ⋮ A parallel primal-dual simplex algorithm ⋮ Airline crew scheduling: state-of-the-art

Cites Work

• Unnamed Item
• Solving large scale crew scheduling problems
• Solving binary cutting stock problems by column generation and branch- and-bound
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
• A global approach to crew-pairing optimization
• Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
• The pivot and probe algorithm for solving a linear program

This page was built for publication: Computational results with a primal-dual subproblem simplex method