Pages that link to "Item:Q3157715"

The following pages link to Jostling for position: local improvement for irregular cutting patterns (Q3157715):

Displaying 18 items.

• An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
• Algorithms for nesting with defects (Q406491) (← links)
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems (Q610988) (← links)
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming (Q819074) (← links)
• Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
• A beam search implementation for the irregular shape packing problem (Q964846) (← links)
• Solution approaches to irregular nesting problems (Q1127203) (← links)
• Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem (Q1268250) (← links)
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon. (Q1592584) (← links)
• A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem (Q1762025) (← links)
• A 2-exchange heuristic for nesting problems (Q1847180) (← links)
• An algorithm for polygon placement using a bottom-left strategy (Q1847183) (← links)
• A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
• A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (Q2116899) (← links)
• Exact approaches for the cutting path determination problem (Q2329729) (← links)
• Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
• Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives (Q5270058) (← links)