Exact solution of bin-packing problems using column generation and branch-and-bound
From MaRDI portal
Publication:1290171
DOI10.1023/A:1018952112615zbMath0922.90113MaRDI QIDQ1290171
Publication date: 10 June 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
side constraints; one-dimensional bin-packing; arc flow formulation; branch-and-price procedure; strong lower bound
90C27: Combinatorial optimization
Related Items
New heuristics for one-dimensional bin-packing, Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem, On compact formulations for integer programs solved by column generation, Arcs-states models for the vehicle routing problem with time windows and related problems, A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, Two heuristics for the one-dimensional bin-packing problem, New lower bounds based on column generation and constraint programming for the pattern minimization problem, 0-1 reformulations of the multicommodity capacitated network design problem, The one-dimensional cutting stock problem with due dates, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, LP models for bin packing and cutting stock problems, Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths, Ranking lower bounds for the bin-packing problem, Solving the one-dimensional bin packing problem with a weight annealing heuristic, Fast lifting procedures for the bin packing problem, Accelerating column generation for variable sized bin-packing problems, Arc-flow model for the two-dimensional guillotine cutting stock problem, Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems, Heuristics for determining the number of warehouses for storing non-compatible products
Uses Software
