Pages that link to "Item:Q4146535"

The following pages link to An Algorithm for Two-Dimensional Cutting Problems (Q4146535):

Displaying 50 items.

• 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)
• 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 exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
• A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
• Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
• Corner occupying theorem for the two-dimensional integral rectangle packing problem (Q362160) (← links)
• A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
• Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644) (← links)
• A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
• The computer as an aid to physical distribution management (Q595498) (← links)
• Bun splitting: a practical cutting stock problem (Q610959) (← links)
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← 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 linear optimization approach to the combined production planning model (Q647983) (← links)
• A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (Q652857) (← links)
• Fast heuristic for constrained homogenous T-shape cutting patterns (Q693480) (← links)
• Recent advances on two-dimensional bin packing problems (Q697576) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
• Network flows and non-guillotine cutting patterns (Q795062) (← links)
• Fixed charge problems with identical fixed charges (Q797500) (← links)
• Logistic constraints in container loading problems: the impact of complete shipment conditions (Q828763) (← 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)
• 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)
• Reactive GRASP for the strip-packing problem (Q941532) (← links)
• Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
• Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← 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 recursive algorithm for constrained two-dimensional cutting problems (Q1029631) (← links)
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints (Q1038331) (← 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)
• Trim-loss pattern rearrangement and its relevance to the flat-glass industry (Q1055339) (← links)
• Practical adaptations of the Gilmore-Gomory approach to cutting stock problems (Q1101335) (← links)
• An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems (Q1127217) (← 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)
• The trim-loss and assortment problems: A survey (Q1143942) (← links)
• An and-or-graph approach for two-dimensional cutting problems (Q1194741) (← links)
• Composite stock cutting through simulated annealing (Q1197089) (← links)
• Limiting the number of each piece in two-dimensional cutting stock patterns (Q1197090) (← links)