Pages that link to "Item:Q3718470"

The following pages link to Algorithms for Unconstrained Two-Dimensional Guillotine Cutting (Q3718470):

Displaying 50 items.

• 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems (Q296590) (← links)
• A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang (Q306089) (← links)
• An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
• A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
• Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642) (← links)
• Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
• A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
• A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
• A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← 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)
• Fast heuristic for constrained homogenous T-shape cutting patterns (Q693480) (← links)
• A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
• Exact algorithm for generating two-segment cutting patterns of punched strips (Q837733) (← links)
• Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
• Packing into the smallest square: worst-case analysis of lower bounds (Q865748) (← links)
• Two-stage general block patterns for the two-dimensional cutting problem (Q878556) (← links)
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
• T-shape homogeneous block patterns for the two-dimensional cutting problem (Q933804) (← links)
• Reactive GRASP for the strip-packing problem (Q941532) (← links)
• Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← 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)
• 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 AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems (Q1127217) (← links)
• Exact solutions for constrained two-dimensional cutting problems (Q1127220) (← links)
• Cutting stock problems and solution procedures (Q1178994) (← links)
• An and-or-graph approach for two-dimensional cutting problems (Q1194741) (← links)
• Composite stock cutting through simulated annealing (Q1197089) (← links)
• Packing problems (Q1197916) (← links)
• The solution of two-stage guillotine cutting stock problems having extremely varying order demands (Q1278246) (← links)
• A recursive exact algorithm for weighted two-dimensional cutting (Q1278248) (← 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)
• 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)
• The cutting stock problem in a hardboard industry: A case study. (Q1406647) (← 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)
• Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study (Q1433163) (← links)
• On the two-dimensional knapsack problem (Q1433651) (← links)
• A comparative numerical analysis for the guillotine two-dimensional cutting problem (Q1593538) (← links)
• Evaluation of algorithms for one-dimensional cutting (Q1603317) (← 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)