Column generation decomposition with the degenerate constraints in the subproblem

DOI10.1016/j.ejor.2010.05.002zbMath1208.90115OpenAlexW2023594256MaRDI QIDQ992573

François Soumis, Abdelmoutalib Metrane, Issmail El Hallaoui

Publication date: 9 September 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.05.002

zbMATH Keywords

linear programmingcolumn generationdegeneracyprimal simplex algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (4)

Dynamic constraint and variable aggregation in column generation ⋮ Integral simplex using decomposition with primal cutting planes ⋮ Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis ⋮ Integral Simplex Using Decomposition for the Set Partitioning Problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• A new version of the improved primal simplex for degenerate linear programs
• Exact solution of bin-packing problems using column generation and branch-and-bound
• A basis-defiency-allowing variation of the simplex method for linear programming
• Bi-dynamic constraint aggregation and subproblem reduction
• Flight String Models for Aircraft Fleeting and Routing
• An Improved Primal Simplex Algorithm for Degenerate Linear Programs
• Decomposition Principle for Linear Programs
• Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: Column generation decomposition with the degenerate constraints in the subproblem