A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
From MaRDI portal
Publication:1847193
DOI10.1016/S0377-2217(02)00125-XzbMath1081.90590OpenAlexW2026751156MaRDI QIDQ1847193
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00125-x
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (39)
Column Generation based Primal Heuristics ⋮ Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ An improved typology of cutting and packing problems ⋮ Accelerating column generation for variable sized bin-packing problems ⋮ An optimization model for trim loss minimization in an automotive glass plant ⋮ One-dimensional cutting stock optimization in consecutive time periods ⋮ Solution approaches for the cutting stock problem with setup cost ⋮ A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ Efficient algorithms for the offline variable sized bin-packing problem ⋮ Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem ⋮ Primal Heuristics for Branch and Price: The Assets of Diving Methods ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution ⋮ Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items ⋮ The generalized assortment and best cutting stock length problems ⋮ A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem ⋮ Solving the variable size bin packing problem with discretized formulations ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ Efficient algorithms for real-life instances of the variable size bin packing problem ⋮ Variable neighbourhood search for the variable sized bin packing problem ⋮ A two-objective mathematical model without cutting patterns for one-dimensional assortment problems ⋮ A combined approach to the solution to the general one-dimensional cutting stock problem ⋮ A nested column generation algorithm to the meta slab allocation problem in the steel making industry ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths ⋮ The stochastic trim-loss problem ⋮ Modified greedy heuristic for the one-dimensional cutting stock problem ⋮ Heuristics for the variable sized bin-packing problem ⋮ An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing ⋮ Cutting planes for branch-and-price algorithms ⋮ L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing ⋮ The two-dimensional bin packing problem with variable bin sizes and costs ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An instance of the cutting stock problem for which the rounding property does not hold
- The modified integer round-up property of the one-dimensional cutting stock problem
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Tighter relaxations for the cutting stock problem
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Finding the Shortest Route between Two Points in a Network
This page was built for publication: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
