An integral simplex algorithm for solving combinatorial optimization problems

DOI10.1023/A:1019758821507zbMath1039.90060OpenAlexW1487378147MaRDI QIDQ1812093

Gerald 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

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

Related Items (14)

Improved integral simplex using decomposition for the set partitioning problem ⋮ All-integer column generation for set partitioning: basic principles and extensions ⋮ 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 ⋮ Valid Inequalities and Separation Algorithms for the Set Partitioning Problem ⋮ A quadratic simplex algorithm for primal optimization over zero-one polytopes ⋮ Column generation in the integral simplex method ⋮ Systematic construction of examples for cycling in the simplex method ⋮ 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 ⋮ Integral Simplex Using Decomposition for the Set Partitioning Problem

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