A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
From MaRDI portal
Publication:726225
DOI10.1016/j.ejor.2014.10.004zbMath1341.90121OpenAlexW2009811818MaRDI QIDQ726225
Publication date: 8 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.10.004
Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (6)
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
Cites Work
- A block-based layer building approach for the 2D guillotine strip packing problem
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A recursive algorithm for constrained two-dimensional cutting problems
- Exact solutions for constrained two-dimensional cutting problems
- 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
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Exact algorithms for the two-dimensional guillotine knapsack
- An efficient deterministic heuristic for two-dimensional rectangular packing
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- An improved version of Wang's algorithm for two-dimensional cutting problems
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A reference length approach for the 3D strip packing problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A prototype column generation strategy for the multiple container loading problem
- An improved typology of cutting and packing problems
- Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem
- A Tree Search Algorithm for Solving the Container Loading Problem
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
- The Theory and Computation of Knapsack Functions
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
This page was built for publication: A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
