Row-reduced column generation for degenerate master problems
From MaRDI portal
Publication:2356253
DOI10.1016/j.ejor.2013.12.016zbMath1317.90188OpenAlexW2096540781MaRDI QIDQ2356253
Marco E. Lübbecke, Jean Bertrand Gauthier, Jacques Desrosiers
Publication date: 29 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.12.016
Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Theory of matrix inversion and generalized inverses (15A09) Direct numerical methods for linear systems and matrix inversion (65F05) Extreme-point and pivoting methods (90C49)
Related Items (5)
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities ⋮ Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows ⋮ Dynamic constraint and variable aggregation in column generation ⋮ Iterated local search and column generation to solve arc-routing as a permutation set-covering problem ⋮ Dual Inequalities for Stabilized Column Generation Revisited
Uses Software
Cites Work
- A new version of the improved primal simplex for degenerate linear programs
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- On the choice of explicit stabilizing terms in column generation
- A basis-defiency-allowing variation of the simplex method for linear programming
- Stabilized dynamic constraint aggregation for solving set partitioning problems
- Bi-dynamic constraint aggregation and subproblem reduction
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Cutting planes for branch-and-price algorithms
- Decomposition Principle for Linear Programs
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Selected Topics in Column Generation
- Unnamed Item
- Unnamed Item
This page was built for publication: Row-reduced column generation for degenerate master problems
