Pages that link to "Item:Q606187"
From MaRDI portal
The following pages link to An exact method for the 2D guillotine strip packing problem (Q606187):
Displaying 20 items.
- A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
- An exact strip packing algorithm based on canonical forms (Q339635) (← links)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints (Q729798) (← links)
- A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint (Q1761795) (← links)
- The two-dimensional cutting stock problem revisited (Q1774168) (← links)
- Exact solution of the 2-dimensional grid arrangement problem (Q1926499) (← links)
- Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
- Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
- Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- A linear programming approach for the three-dimensional bin-packing problem (Q2861521) (← links)
- An exact approach to the strip-packing problem (Q2884561) (← links)
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← links)
- An Exact Algorithm for the Two-Dimensional Strip-Packing Problem (Q3098338) (← links)
- Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
- Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem (Q4596196) (← links)
- Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem (Q4979988) (← links)