A recursive exact algorithm for weighted two-dimensional cutting
From MaRDI portal
Publication:1278248
DOI10.1016/0377-2217(95)00343-6zbMath0924.90118OpenAlexW2010428988MaRDI QIDQ1278248
Vassilios Zissimopoulos, Mhand Hifi
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00343-6
Related Items (16)
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ Two-stage general block patterns for the two-dimensional cutting problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ Exact algorithms for the guillotine strip cutting/packing problem. ⋮ An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems ⋮ A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. ⋮ Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study ⋮ A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects ⋮ T-shape homogeneous block patterns for the two-dimensional cutting problem ⋮ Simple block patterns for the two-dimensional cutting problem ⋮ An exact algorithm for the knapsack sharing problem ⋮ A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems ⋮ Generating optimal two-section cutting patterns for rectangular blanks
Cites Work
- Unnamed Item
- Unnamed Item
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- An and-or-graph approach for two-dimensional cutting problems
- Packing problems
- An improved version of Wang's algorithm for two-dimensional cutting problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- An Algorithm for Two-Dimensional 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
- Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions
This page was built for publication: A recursive exact algorithm for weighted two-dimensional cutting
