An integral simplex algorithm for solving combinatorial optimization problems

DOI10.1023/A:1019758821507MaRDI QIDQ1812093zbMATH OpenOpenAlexFDO

Authors G. L. Thompson

Publication date 18 June 2003

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019758821507

zbMATH Keywords

combinatorial optimizationsimplex algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• Integral simplex using decomposition for the set partitioning problem
• Integral simplex using double decomposition for set partitioning problems
• Column generation in the integral simplex method
• Integral simplex methods for the set partitioning problem: globalisation and anti-cycling
• Simplex pivots on the set packing polytope

Cited in

(20)

• Integral simplex using decomposition for the set partitioning problem
• Improved integral simplex using decomposition for the set partitioning problem
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Systematic construction of examples for cycling in the simplex method
• Integral Column Generation for Set Partitioning Problems with Side Constraints
• All-integer column generation for set partitioning: basic principles and extensions
• Simplex pivots on the set packing polytope
• 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
• Influence of the normalization constraint on the integral simplex using decomposition
• Formalization of Incremental Simplex Algorithm by Stepwise Refinement
• Integral simplex using double decomposition for set partitioning problems
• Integral simplex methods for the set partitioning problem: globalisation and anti-cycling
• Improving set partitioning problem solutions by zooming around an improving direction
• Column generation in the integral simplex method
• Integral simplex using decomposition with primal cutting planes
• A quadratic simplex algorithm for primal optimization over zero-one polytopes
• Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
• Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
• scientific article; zbMATH DE number 2087094 (Why is no real title available?)
• A portable and scalable algorithm for a class of constrained combinatorial optimization problems

This page was built for publication: An integral simplex algorithm for solving combinatorial optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812093)