Using Extra Dual Cuts to Accelerate Column Generation

DOI10.1287/ijoc.1030.0060zbMath1239.90089MaRDI QIDQ2890465

José M. Valério de Carvalho

Publication date: 8 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1030.0060

zbMATH Keywords

column generation; bin packing; cutting stock

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Related Items

An exact approach for the vertex coloring problem, A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint, A note on branch-and-cut-and-price, A generalization of column generation to accelerate convergence, A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times, Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design, A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, Models and algorithms for three-stage two-dimensional bin packing, Accelerating column generation for variable sized bin-packing problems, Exactly solving a two-level location problem with modular node capacities

Uses Software

• OR-Library