Pages that link to "Item:Q1825758"

The following pages link to An improved version of Wang's algorithm for two-dimensional cutting problems (Q1825758):

Displaying 29 items.

• 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 bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
• Exact solutions for constrained two-dimensional cutting problems (Q1127220) (← links)
• Packing problems (Q1197916) (← links)
• Solution for the constrained Guillotine cutting problem by simulated annealing (Q1265860) (← 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)
• An improved version of Wang's algorithm for two-dimensional cutting problems written by J. F. Oliveira and J. S. Ferraira (Q1333528) (← links)
• An interactive technique for the cutting stock problem with multiple objectives (Q1342019) (← 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)
• Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
• 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
• Solving the pallet loading problem (Q2384612) (← links)
• An EDA for the 2D knapsack problem with guillotine constraint (Q2418151) (← links)
• An enumeration scheme to generate constrained exact checkerboard patterns (Q2462561) (← links)
• An integrated cutting stock and sequencing problem (Q2643965) (← links)
• An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← 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)
• Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais (Q3621505) (← 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)