Pages that link to "Item:Q1268250"

The following pages link to Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem (Q1268250):

Displayed 9 items.

• A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) ‎ (← links)
• Tools of mathematical modeling of arbitrary object packing problems (Q610987) ‎ (← links)
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming (Q819074) ‎ (← links)
• Regular packing of congruent polygons on the rectangular sheet (Q1124824) ‎ (← links)
• Solution approaches to irregular nesting problems (Q1127203) ‎ (← links)
• Rotational polygon overlap minimization and compaction (Q1265289) ‎ (← links)
• A method of optimal lattice packing of congruent oriented polygons in the plane (Q1576353) ‎ (← links)
• Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement (Q1974322) ‎ (← links)
• A hybrid approach for packing irregular patterns using evolutionary strategies and neural network (Q3163153) ‎ (← links)