An Inexact Bundle Approach to Cutting-Stock Problems

DOI10.1287/ijoc.1090.0326zbMath1243.90138OpenAlexW2160112640MaRDI QIDQ2899044

Krzysztof C. Kiwiel

Publication date: 28 July 2012

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

Full work available at URL: https://rcin.org.pl/dlibra/docmetadata?showContent=true&id=144843

zbMATH Keywords

integer programmingLagrangian relaxationbundle methodsknapsack problemscutting stocknondifferentiable convex optimization

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Interior-point methods (90C51)

Related Items

Column Generation based Primal Heuristics, Bin packing and cutting stock problems: mathematical models and exact algorithms, A cutting stock problem in the wood products industry: a two‐stage solution approach, Level bundle methods for constrained convex optimization with various oracles, Reducing the number of cuts in generating three-staged cutting patterns, Derivative-free optimization via proximal point methods, Comparison of bundle and classical column generation, The omnipresence of Lagrange, An inexact bundle variant suited to column generation

Uses Software

• OR-Library
• CUTGEN1