Pages that link to "Item:Q3098338"
From MaRDI portal
The following pages link to An Exact Algorithm for the Two-Dimensional Strip-Packing Problem (Q3098338):
Displaying 43 items.
- An effective shaking procedure for 2D and 3D strip packing problems (Q336597) (← links)
- A Lagrangian heuristic for sprint planning in agile software development (Q336900) (← links)
- A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
- An exact strip packing algorithm based on canonical forms (Q339635) (← links)
- Scheduling inspired models for two-dimensional packing problems (Q421612) (← links)
- A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
- An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem (Q724050) (← links)
- A new search procedure for the two-dimensional orthogonal packing problem (Q894552) (← links)
- A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
- Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
- A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
- The problem of strip packing: An asymptotically exact approach (Q1282481) (← links)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation (Q1652199) (← links)
- The value of integrating loading and routing (Q1752774) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- Models and bounds for two-dimensional level packing problems (Q1888172) (← links)
- Exact solution of the 2-dimensional grid arrangement problem (Q1926499) (← links)
- Conservative scales in packing problems (Q1944876) (← links)
- Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- A hybrid metaheuristic for the two-dimensional strip packing problem (Q2069243) (← links)
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338) (← links)
- Fragmentary structures in a two-dimensional strip packing problem (Q2174049) (← links)
- Order and static stability into the strip packing problem (Q2259026) (← links)
- An open space based heuristic for the 2D strip packing problem with unloading constraints (Q2310581) (← links)
- Exhaustive approaches to 2D rectangular perfect packings (Q2390210) (← links)
- Triple-solution approach for the strip packing problem with two-staged patterns (Q2410108) (← links)
- A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
- Exact solution of the two-dimensional finite bin packing problem (Q2783932) (← links)
- Upper bounds for heuristic approaches to the strip packing problem (Q2803257) (← links)
- An exact approach to the strip-packing problem (Q2884561) (← links)
- Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← links)
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
- Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem (Q4596196) (← links)
- New Lower Bound and Exact Method for the Continuous Berth Allocation Problem (Q4971379) (← links)
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
- The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
