Hierarchical rectangle packing solved by multi-level recursive logic-based benders decomposition
From MaRDI portal
Cites work
- A branch and bound algorithm for the strip packing problem
- A branch-and-price algorithm for the temporal bin packing problem
- A Constraint-Based Approach for the Two-Dimensional Rectangular Packing Problem with Orthogonal Orientations
- A Linear Programming Approach to the Cutting-Stock Problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A space-indexed formulation of packing boxes into a larger box
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- An analytical model for the container loading problem
- An exact algorithm for the two-dimensional strip-packing problem
- An exact approach to the strip-packing problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Automated placement of analog integrated circuits using priority-based constructive heuristic
- Bayesian network learning via topological order
- Boosting an exact logic-based Benders decomposition approach by variable neighborhood search
- Combinatorial Benders' cuts for the strip packing problem
- Exact solution techniques for two-dimensional cutting and packing
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Metaheuristics for bilevel optimization: a comprehensive review
- Models and algorithms for packing rectangles into the smallest square
- Multistage Cutting Stock Problems of Two and More Dimensions
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
- Nested logic-based benders decomposition for an integrated home healthcare problem
- Optimal rectangle packing
- Periodic chains scheduling on dedicated resources -- a crucial problem in time-sensitive networks
- Scheduling with uncertain processing times in mixed-criticality systems
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
This page was built for publication: Hierarchical rectangle packing solved by multi-level recursive logic-based benders decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348452)
