Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
From MaRDI portal
Publication:842766
DOI10.1007/s10589-007-9081-5zbMath1179.90283OpenAlexW2015020841WikidataQ29035628 ScholiaQ29035628MaRDI QIDQ842766
Mhand Hifi, Rym M'Hallah, Toufik Saadi
Publication date: 25 September 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9081-5
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- A recursive exact algorithm for weighted two-dimensional cutting
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- On the two-dimensional knapsack problem
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- An improved typology of cutting and packing problems
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Orthogonal Packings in Two Dimensions
- An Algorithm for Two-Dimensional Cutting Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
This page was built for publication: Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
