A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
From MaRDI portal
Publication:2289918
Recommendations
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
- Modeling two-dimensional guillotine cutting problems via integer programming
- Strip based compact formulation for two-dimensional guillotine cutting problems
Cites work
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- A block-based layer building approach for the 2D guillotine strip packing problem
- A branch and bound algorithm for the strip packing problem
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- A New Linear Programming Approach to the Cutting Stock Problem
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- An Algorithm for Two-Dimensional Cutting Problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An improved typology of cutting and packing problems
- An improved version of Wang's algorithm for two-dimensional cutting problems
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- Exact algorithms for the two-dimensional guillotine knapsack
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Linear models for 1-group two-dimensional guillotine cutting problems
- Modeling two-dimensional guillotine cutting problems via integer programming
- Multistage Cutting Stock Problems of Two and More Dimensions
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The Theory and Computation of Knapsack Functions
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Two-dimensional packing problems: a survey
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
Cited in
(14)- Exact solution techniques for two-dimensional cutting and packing
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- Strip based compact formulation for two-dimensional guillotine cutting problems
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
- 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
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- A Hybrid Optimization Framework for Cutting and Packing Problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- EATKG: an open-source efficient \underline{E}xact \underline{A}lgorithm for the \underline{T}wo-dimensional \underline{K}napsack problem with \underline{G}uillotine constraints
- A polynomial mixed-integer linear programming model for two-dimensional guillotine strip packing problem
- Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- An exact method for storage space assignment at airport cargo terminal: a temporal-spatial packing problem
This page was built for publication: A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289918)
