A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems
From MaRDI portal
Publication:429470
DOI10.1007/s10589-010-9351-5zbMath1245.90104OpenAlexW1983834134MaRDI QIDQ429470
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9351-5
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Unnamed Item ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
Uses Software
Cites Work
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The cutting stock problem in a hardboard industry: A case study.
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- A typology of cutting and packing problems
- 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
- GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem
- Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
This page was built for publication: A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems
