Pages that link to "Item:Q3666624"
From MaRDI portal
The following pages link to Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems (Q3666624):
Displaying 29 items.
- The maximum diversity assortment selection problem (Q2040441) (← links)
- Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- A data-driven approach for mixed-case palletization with support (Q2168642) (← links)
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns (Q2384599) (← links)
- Solving the pallet loading problem (Q2384612) (← links)
- An EDA for the 2D knapsack problem with guillotine constraint (Q2418151) (← links)
- An enumeration scheme to generate constrained exact checkerboard patterns (Q2462561) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems (Q2643947) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem (Q2643950) (← links)
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem (Q2643953) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
- Two dimensional guillotine cutting stock and scheduling problem in printing industry (Q2676408) (← links)
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← links)
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574) (← links)
- The pallet packing problem for non-uniform box sizes (Q3354581) (← links)
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces (Q3401326) (← links)
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems (Q3401336) (← links)
- A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM (Q3503066) (← links)
- Relaxation techniques applied to some loading problems (Q4327925) (← links)
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems (Q5959380) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← 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)