All-integer column generation for set partitioning: basic principles and extensions

DOI10.1016/j.ejor.2013.08.036zbMath1339.90241OpenAlexW1976578266WikidataQ61940978 ScholiaQ61940978MaRDI QIDQ296975

Torbjörn Larsson, Elina Rönnberg

Publication date: 24 June 2016

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-76091

zbMATH Keywords

integer programmingcolumn generationset partitioningall-integer pivotsquasi-integrality

Mathematics Subject Classification ID

Integer programming (90C10) Extreme-point and pivoting methods (90C49)

Related Items

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 ⋮ Influence of the normalization constraint on the integral simplex using decomposition

Uses Software

• OR-Library
• ISUD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branching in branch-and-price: A generic scheme
• A feasible direction method for linear programming
• Column generation in the integral simplex method
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• 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
• Integral Simplex Using Decomposition for the Set Partitioning Problem
• Column Generation based Primal Heuristics
• Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
• A Method of Decomposition for Integer Programs
• A Column Generation Approach for Large-Scale Aircrew Rostering Problems
• Selected Topics in Column Generation
• On the Set-Covering Problem