Integral Simplex Using Decomposition for the Set Partitioning Problem

DOI10.1287/opre.2013.1247zbMath1295.90064OpenAlexW2140541505MaRDI QIDQ2875612

François Soumis, Abdelouahab Zaghrouti, Issmail El Hallaoui

Publication date: 11 August 2014

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

Full work available at URL: https://doi.org/10.1287/opre.2013.1247

zbMATH Keywords

decompositionset partitioning problemintegral simplex

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Improved integral simplex using decomposition for the set partitioning problem, All-integer column generation for set partitioning: basic principles and extensions, Distributed integral column generation for set partitioning problems, The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties, Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows, Integral simplex using decomposition with primal cutting planes, 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, Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling, Linear fractional approximations for master problems in column generation, Dynamic constraint aggregation for solving very large-scale airline crew pairing problems, Avoiding redundant columns by adding classical Benders cuts to column generation subproblems, Integral simplex using double decomposition for set partitioning problems, Influence of the normalization constraint on the integral simplex using decomposition, Improving set partitioning problem solutions by zooming around an improving direction, Vector Space Decomposition for Solving Large-Scale Linear Programs, ISUD

Cites Work

• A new version of the improved primal simplex for degenerate linear programs
• Column generation in the integral simplex method
• Multi-phase dynamic constraint aggregation for set partitioning type problems
• Column generation decomposition with the degenerate constraints in the subproblem
• The integral basis method for integer programming
• An integral simplex algorithm for solving combinatorial optimization problems
• An Improved Primal Simplex Algorithm for Degenerate Linear Programs
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• On the Set-Covering Problem