Cutting Stock Problems

DOI10.1007/0-387-25486-2_5zbMath1246.90161OpenAlexW2241927630MaRDI QIDQ5493630

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

Publication date: 16 October 2006

Published in: Column Generation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/0-387-25486-2_5

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems, A generalization of column generation to accelerate convergence, Bin packing and cutting stock problems: mathematical models and exact algorithms, A stabilized structured Dantzig-Wolfe decomposition method, Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost, Simultaneously exploiting two formulations: an exact Benders decomposition approach, On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage, Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem, Exploiting Packing Components in General-Purpose Integer Programming Solvers, Stabilized branch-and-price algorithms for vector packing problems, Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation, Dual Inequalities for Stabilized Column Generation Revisited, A lexicographic pricer for the fractional bin packing problem, An inexact bundle variant suited to column generation, Projective Cutting-Planes