Row-reduced column generation for degenerate master problems
From MaRDI portal
Publication:2356253
Recommendations
- Column generation decomposition with the degenerate constraints in the subproblem
- Row-Oriented Decomposition in Large-Scale Linear Optimization
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- Generalized column generation for linear programming
- Linear fractional approximations for master problems in column generation
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows
- On the relaxed greedy deterministic row and column iterative methods
- A generalization of column generation to accelerate convergence
- Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem
- scientific article; zbMATH DE number 4072707
Cites work
- A basis-defiency-allowing variation of the simplex method for linear programming
- A new version of the improved primal simplex for degenerate linear programs
- 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
- scientific article; zbMATH DE number 1452994 (Why is no real title available?)
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Network flows. Theory, algorithms, and applications.
- On the choice of explicit stabilizing terms in column generation
- Selected Topics in Column Generation
- Stabilized dynamic constraint aggregation for solving set partitioning problems
Cited in
(11)- Dynamic constraint and variable aggregation in column generation
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows
- Linear fractional approximations for master problems in column generation
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
- Dual inequalities for stabilized column generation revisited
- A Potential Reduction Algorithm Allowing Column Generation
- Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows
- Last fifty years of integer linear programming: a focus on recent practical advances
- Column generation decomposition with the degenerate constraints in the subproblem
This page was built for publication: Row-reduced column generation for degenerate master problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2356253)