Pages that link to "Item:Q1268250"
From MaRDI portal
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 15 items.
- Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← links)
- 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)
- Packing different cuboids with rotations and spheres into a cuboid (Q2260526) (← links)
- Irregular packing problems: a review of mathematical models (Q2286866) (← links)
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network (Q3163153) (← links)
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)
- The concept of modeling packing and covering problems using modern computational geometry software (Q6160558) (← links)