A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
From MaRDI portal
Publication:2643948
DOI10.1016/j.ejor.2005.11.060zbMath1138.90433OpenAlexW2017429417MaRDI QIDQ2643948
Roberto Baldacci, Marco Antonio Boschetti
Publication date: 27 August 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.060
Related Items (27)
MPQ-trees for orthogonal packing problem ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ A survey of dual-feasible and superadditive functions ⋮ The off-line group seat reservation problem ⋮ A cutting plane method and a parallel algorithm for packing rectangles in a circular container ⋮ An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ MPQ-trees for the orthogonal packing problem ⋮ Conservative scales in packing problems ⋮ The three-dimensional knapsack problem with balancing constraints ⋮ Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution ⋮ Using dual feasible functions to construct fast lower bounds for routing and location problems ⋮ Heuristic approaches for the two- and three-dimensional knapsack packing problem ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ Consecutive ones matrices for multi-dimensional orthogonal packing problems ⋮ Multi-dimensional bin packing problems with guillotine constraints ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Consecutive ones matrices for multi-dimensional orthogonal packing problems ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting ⋮ Unnamed Item ⋮ An efficient deterministic optimization approach for rectangular packing problems ⋮ On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average-case analysis of cutting and packing in two dimensions
- Network flows and non-guillotine cutting patterns
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- An analytical model for the container loading problem
- Cutting stock problems and solution procedures
- Packing problems
- Geometric algorithms and combinatorial optimization
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Packing small boxes into a big box.
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- On the two-dimensional knapsack problem
- An exact algorithm for the pallet loading problem
- A typology of cutting and packing problems
- Efficient automated pallet loading
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- Two-dimensional packing problems: a survey
- Models and bounds for two-dimensional level packing problems
- An improved typology of cutting and packing problems
- An Exact Approach to the Strip-Packing Problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An approach to two-dimensional cutting stock problems
- Orthogonal Packings in Two Dimensions
- A algorithm for two-dimensional packing
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- An Algorithm for Two-Dimensional Cutting Problems
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Recursive Computational Procedure for Two-dimensional Stock Cutting
This page was built for publication: A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
