Column generation in the integral simplex method

DOI10.1016/j.ejor.2007.09.037zbMath1180.90202OpenAlexW2082860577WikidataQ61940981 ScholiaQ61940981MaRDI QIDQ948677

Elina Rönnberg, Torbjörn Larsson

Publication date: 17 October 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15287

zbMATH Keywords

implicit enumerationset partitioningquasi-integrality

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

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 ⋮ An integer optimality condition for column generation on zero-one linear programs ⋮ 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 ⋮ 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 ⋮ Integral Simplex Using Decomposition for the Set Partitioning Problem

Cites Work

• A characterization of the uncapacitated network design polytope
• One and two facility network design revisited
• An integral simplex algorithm for solving combinatorial optimization problems
• A technical review of column generation in integer programming
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Selected Topics in Column Generation
• On the Set-Covering Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Column generation in the integral simplex method