Pages that link to "Item:Q4272900"
From MaRDI portal
The following pages link to Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems (Q4272900):
Displaying 29 items.
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642) (← links)
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (Q652857) (← links)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
- An exact algorithm for generating homogeneous T-shape cutting patterns (Q856687) (← links)
- Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
- A recursive algorithm for constrained two-dimensional cutting problems (Q1029631) (← links)
- Solution for the constrained Guillotine cutting problem by simulated annealing (Q1265860) (← links)
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (Q1278579) (← links)
- An improved version of Wang's algorithm for two-dimensional cutting problems written by J. F. Oliveira and J. S. Ferraira (Q1333528) (← links)
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (Q1370660) (← links)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. (Q1413922) (← links)
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (Q1768600) (← links)
- An effective quasi-human based heuristic for solving the rectangle packing problem (Q1847202) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns (Q2384599) (← links)
- An EDA for the 2D knapsack problem with guillotine constraint (Q2418151) (← links)
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166) (← links)
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← links)
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574) (← 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 tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems (Q5959380) (← 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)
