Pages that link to "Item:Q3686413"
From MaRDI portal
The following pages link to An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure (Q3686413):
Displaying 50 items.
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang (Q306089) (← links)
- A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
- Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
- A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- Packing circular-like objects in a rectangular container (Q499146) (← links)
- Parameterized complexity of strip packing and minimum volume packing (Q501656) (← links)
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
- Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← 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)
- Logistic constraints in container loading problems: the impact of complete shipment conditions (Q828763) (← links)
- Packing into the smallest square: worst-case analysis of lower bounds (Q865748) (← links)
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Characterization and modelling of guillotine constraints (Q930945) (← links)
- Reactive GRASP for the strip-packing problem (Q941532) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- Computing stable loads for pallets (Q992703) (← links)
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem (Q1015322) (← links)
- A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems (Q1101335) (← links)
- An application of simulated annealing to the cutting stock problem (Q1124712) (← links)
- Regular packing of congruent polygons on the rectangular sheet (Q1124824) (← links)
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems (Q1127217) (← links)
- Packing different-sized circles into a rectangular container (Q1127229) (← links)
- An analytical model for the container loading problem (Q1129950) (← links)
- Cutting stock problems and solution procedures (Q1178994) (← links)
- Composite stock cutting through simulated annealing (Q1197089) (← links)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- Packing problems (Q1197916) (← links)
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem (Q1268250) (← links)
- A recursive exact algorithm for weighted two-dimensional cutting (Q1278248) (← links)
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (Q1278579) (← links)
- On the effectivity of gradient methods for cutting stock problems (Q1342431) (← links)
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927) (← links)
- A method for the cutting stock problem with different qualities (Q1388928) (← links)
- On the two-dimensional knapsack problem (Q1433651) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation (Q1652199) (← links)
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem (Q1665961) (← links)
