Integral simplex using decomposition for the set partitioning problem
From MaRDI portal
Recommendations
- Integral simplex using double decomposition for set partitioning problems
- Improved integral simplex using decomposition for the set partitioning problem
- An integral simplex algorithm for solving combinatorial optimization problems
- Influence of the normalization constraint on the integral simplex using decomposition
- Improving set partitioning problem solutions by zooming around an improving direction
Cites work
- A new version of the improved primal simplex for degenerate linear programs
- An improved primal simplex algorithm for degenerate linear programs
- An integral simplex algorithm for solving combinatorial optimization problems
- Column generation decomposition with the degenerate constraints in the subproblem
- Column generation in the integral simplex method
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- On the Set-Covering Problem
- On the Set-Covering Problem: II. An Algorithm for Set Partitioning
- The integral basis method for integer programming
Cited in
(23)- Improved integral simplex using decomposition for the set partitioning problem
- Integral simplex using decomposition with primal cutting planes
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
- Linear fractional approximations for master problems in column generation
- An integral simplex algorithm for solving combinatorial optimization problems
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- Distributed integral column generation for set partitioning problems
- Dynamic constraint aggregation for solving very large-scale airline crew pairing problems
- Integral simplex using double decomposition for set partitioning problems
- Improving set partitioning problem solutions by zooming around an improving direction
- Integral simplex methods for the set partitioning problem: globalisation and anti-cycling
- All-integer column generation for set partitioning: basic principles and extensions
- The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties
- Cardinality and the Simplex Tableau for the Set Partitioning Problem
- Simplex pivots on the set packing polytope
- ISUD
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows
- Integral Column Generation for Set Partitioning Problems with Side Constraints
- Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems
- The complexity of geometric scaling
- Augmentation search for integer programming over a polyhedron
- Influence of the normalization constraint on the integral simplex using decomposition
This page was built for publication: Integral simplex using decomposition for the set partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875612)
