Pages that link to "Item:Q1768600"
From MaRDI portal
The following pages link to Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (Q1768600):
Displayed 13 items.
- A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- A recursive algorithm for constrained two-dimensional cutting problems (Q1029631) (← links)
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study (Q1433163) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems (Q1991111) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern (Q6067889) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)