Dual-Optimal Inequalities for Stabilized Column Generation

DOI10.1287/opre.1060.0278zbMath1167.90529OpenAlexW2072078883MaRDI QIDQ3391991

Jacques Desrosiers, Hatem M. T. Ben Amor, José M. Valério de Carvalho

Publication date: 13 August 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1060.0278

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Management decision making, including multiple objectives (90B50)

Related Items (32)

Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities ⋮ Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management ⋮ A generalization of column generation to accelerate convergence ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ Integer linear programming models for the skiving stock problem ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times ⋮ Accelerating column generation for variable sized bin-packing problems ⋮ Hybrid methods for lot sizing on parallel machines ⋮ A stabilized structured Dantzig-Wolfe decomposition method ⋮ Integrated Charge Batching and Casting Width Selection at Baosteel ⋮ Stabilizing branch‐and‐price for constrained tree problems ⋮ Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows ⋮ A branch-and-price algorithm for capacitated hypergraph vertex separation ⋮ Simultaneously exploiting two formulations: an exact Benders decomposition approach ⋮ The transit time constrained fixed charge multi-commodity network design problem ⋮ Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Characterizing the optimality gap and the optimal packings for the bin packing problem ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Stabilized branch-and-price algorithms for vector packing problems ⋮ Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes ⋮ Reductions of Approximate Linear Programs for Network Revenue Management ⋮ Dual Inequalities for Stabilized Column Generation Revisited ⋮ Vector Space Decomposition for Solving Large-Scale Linear Programs ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times ⋮ Chebyshev center based column generation ⋮ Two-echelon vehicle routing problems: a literature review ⋮ A proximal trust-region algorithm for column generation stabilization ⋮ A branch-and-price algorithm for the temporal bin packing problem

Uses Software

• OR-Library

This page was built for publication: Dual-Optimal Inequalities for Stabilized Column Generation