Exact algorithms for the two-dimensional guillotine knapsack
From MaRDI portal
Recommendations
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- On the two-dimensional knapsack problem
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A Linear Programming Approach to the Cutting-Stock Problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- A new upper bound for unconstrained two-dimensional cutting and packing
- A recursive algorithm for constrained two-dimensional cutting problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An improved typology of cutting and packing problems
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Models and algorithms for three-stage two-dimensional bin packing
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- On rectangle packing, maximizing benefits
- On the two-dimensional knapsack problem
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(22)- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- Minimum tiling of a rectangle by squares
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Exact solution techniques for two-dimensional cutting and packing
- An EDA for the 2D knapsack problem with guillotine constraint
- Scheduling inspired models for two-dimensional packing problems
- On the two-dimensional knapsack problem
- 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
- Tight complexity bounds for the two-dimensional real knapsack problem
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- Modeling two-dimensional guillotine cutting problems via integer programming
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Strip based compact formulation for two-dimensional guillotine cutting problems
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- Heuristics for packing semifluids
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
This page was built for publication: Exact algorithms for the two-dimensional guillotine knapsack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761943)
