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 50 items.
- Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
- A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- 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)
- The off-line group seat reservation problem (Q613435) (← 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)
- An algorithm for the two-dimensional assortment problem (Q759646) (← links)
- Fixed charge problems with identical fixed charges (Q797500) (← 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)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
- A recursive algorithm for constrained two-dimensional cutting problems (Q1029631) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems (Q1101335) (← links)
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
- Exact solutions for constrained two-dimensional cutting problems (Q1127220) (← links)
- An analytical model for the container loading problem (Q1129950) (← links)
- Cutting stock problems and solution procedures (Q1178994) (← links)
- Limiting the number of each piece in two-dimensional cutting stock patterns (Q1197090) (← links)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- Packing problems (Q1197916) (← links)
- Solution for the constrained Guillotine cutting problem by simulated annealing (Q1265860) (← links)
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands (Q1278246) (← links)
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach (Q1278342) (← links)
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (Q1278579) (← links)
- An algorithm for the 2D guillotine cutting stock problem (Q1309924) (← links)
- Solution procedures for cutting lumber into furniture parts (Q1328641) (← links)
- An improved version of Wang's algorithm for two-dimensional cutting problems written by J. F. Oliveira and J. S. Ferraira (Q1333528) (← links)
- On the effectivity of gradient methods for cutting stock problems (Q1342431) (← links)
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (Q1370660) (← links)
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts (Q1388926) (← links)
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927) (← 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)
- On the two-dimensional knapsack problem (Q1433651) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- An efficient deterministic heuristic for two-dimensional rectangular packing (Q1762123) (← links)
- An improved version of Wang's algorithm for two-dimensional cutting problems (Q1825758) (← links)
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations (Q1825764) (← links)
- An effective quasi-human based heuristic for solving the rectangle packing problem (Q1847202) (← links)
- A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
- The nesting problem in the leather manufacturing industry (Q1897382) (← links)
- Interactive procedures in large-scale two-dimensional cutting stock problems (Q1919382) (← links)
