An integer optimality condition for column generation on zero-one linear programs

DOI10.1016/j.disopt.2018.09.001zbMath1506.90164OpenAlexW2893945456WikidataQ61940968 ScholiaQ61940968MaRDI QIDQ2419361

Torbjörn Larsson, Elina Rönnberg

Publication date: 13 June 2019

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2018.09.001

zbMATH Keywords

column generationoptimality conditionsinteger linear programmingdiscrete optimisationzero-one linear programming

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (2)

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 ⋮ Avoiding redundant columns by adding classical Benders cuts to column generation subproblems

Cites Work

• Unnamed Item
• All-integer column generation for set partitioning: basic principles and extensions
• Branching in branch-and-price: A generic scheme
• Column generation in the integral simplex method
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• A technical review of column generation in integer programming
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems
• A Method of Decomposition for Integer Programs
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• An efficient implementation of an algorithm for findingK shortest simple paths
• Selected Topics in Column Generation
• Combining Column Generation and Lagrangian Relaxation

This page was built for publication: An integer optimality condition for column generation on zero-one linear programs