Exact algorithms for the two-dimensional guillotine knapsack
From MaRDI portal
Publication:1761943
DOI10.1016/j.cor.2010.12.018zbMath1251.90237OpenAlexW2082836978MaRDI QIDQ1761943
Mohammad Dolatabadi, Michele Monaci, Andrea Lodi
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.12.018
Related Items
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem, An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts, An EDA for the 2D knapsack problem with guillotine constraint, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, Scheduling inspired models for two-dimensional packing problems, Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem, Minimum tiling of a rectangle by squares, Improved state space relaxation for constrained two-dimensional guillotine cutting problems, Exact solution techniques for two-dimensional cutting and packing, A bidirectional building approach for the 2D constrained guillotine knapsack packing problem, Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints, Heuristics for packing semifluids, A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem, Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers, Enhanced formulation for the Guillotine 2D Cutting knapsack problem, Strip based compact formulation for two-dimensional guillotine cutting problems, On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
Uses Software
Cites Work
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- A recursive algorithm 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
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- On the two-dimensional knapsack problem
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- An improved typology of cutting and packing problems
- Models and algorithms for three-stage two-dimensional bin packing
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- An Algorithm for Two-Dimensional Cutting Problems
- A new upper bound for unconstrained two-dimensional cutting and packing
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Unnamed Item
- Unnamed Item
