An exact algorithm for the two-dimensional strip-packing problem
From MaRDI portal
Recommendations
- An exact approach to the strip-packing problem
- A branch and bound algorithm for the strip packing problem
- An exact strip packing algorithm based on canonical forms
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- An exact method for the 2D guillotine strip packing problem
Cited in
(56)- A branch and bound algorithm for the strip packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- The problem of strip packing: An asymptotically exact approach
- Exact algorithms for the guillotine strip cutting/packing problem.
- Logic based Benders' decomposition for orthogonal stock cutting problems
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- The value of integrating loading and routing
- Two-dimensional packing problems: a survey
- Models and bounds for two-dimensional level packing problems
- Exact solution of the 2-dimensional grid arrangement problem
- Conservative scales in packing problems
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Exact solution techniques for two-dimensional cutting and packing
- A hybrid metaheuristic for the two-dimensional strip packing problem
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
- Fragmentary structures in a two-dimensional strip packing problem
- Order and static stability into the strip packing problem
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- Heuristics for the score-constrained strip-packing problem
- Exhaustive approaches to 2D rectangular perfect packings
- Triple-solution approach for the strip packing problem with two-staged patterns
- A new exact method for the two-dimensional orthogonal packing problem
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- Exact solution of the two-dimensional finite bin packing problem
- Upper bounds for heuristic approaches to the strip packing problem
- An exact approach to the strip-packing problem
- Combinatorial Benders' cuts for the strip packing problem
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- A SAT-based method for solving the two-dimensional strip packing problem
- An effective shaking procedure for 2D and 3D strip packing problems
- A Lagrangian heuristic for sprint planning in agile software development
- A simple randomized algorithm for two-dimensional strip packing
- An exact strip packing algorithm based on canonical forms
- Scheduling inspired models for two-dimensional packing problems
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- Creating worst-case instances for upper and lower bounds of the two-dimensional strip packing problem
- Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem
- Creating worst-case instances for lower bounds of the 2D strip packing problem
- New lower bound and exact method for the continuous berth allocation problem
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- A nonlinear programming model for two-dimensional strip-packing problem and its numerical method
- An optimization model for the strip-packing problem and its augmented Lagrangian method
- An exact method for the 2D guillotine strip packing problem
- Solving the strip packing problem with a decomposition framework and a generic solver: implementation, tuning, and reinforcement-learning-based hybridization
- 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
- Exact methods for the split delivery vehicle routing problem with two-dimensional loading constraints
- Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
- A new branch-and-cut approach for integrated planning in additive manufacturing
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
- Exact algorithms for energy-constrained scheduling on identical parallel machines
- Hierarchical rectangle packing solved by multi-level recursive logic-based benders decomposition
- A new search procedure for the two-dimensional orthogonal packing problem
This page was built for publication: An exact algorithm for the two-dimensional strip-packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098338)
