Pages that link to "Item:Q1127207"

The following pages link to Compaction and separation algorithms for non-convex polygons and their applications (Q1127207):

Displaying 32 items.

• Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← 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)
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem (Q1040080) (← links)
• Rotational polygon overlap minimization and compaction (Q1265289) (← links)
• A method of optimal lattice packing of congruent oriented polygons in the plane (Q1576353) (← links)
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon. (Q1592584) (← links)
• Densest translational lattice packing of non-convex polygons (Q1602949) (← 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 moment based metric for 2-D and 3-D packing (Q1971998) (← links)
• Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
• Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning (Q2242334) (← links)
• A fully general, exact algorithm for nesting irregular shapes (Q2250088) (← links)
• Mathematical model and efficient algorithms for object packing problem (Q2269838) (← links)
• Mixed-integer programming models for nesting problems (Q2271127) (← links)
• Irregular packing problems: a review of mathematical models (Q2286866) (← links)
• A heuristic algorithm for solving triangle packing problem (Q2312258) (← links)
• Raster penetration map applied to the irregular packing problem (Q2312355) (← links)
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
• A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums (Q2384604) (← links)
• The geometry of nesting problems: a tutorial (Q2384608) (← links)
• An improved typology of cutting and packing problems (Q2643945) (← links)
• Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
• A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes (Q3044033) (← links)
• A hybrid approach for packing irregular patterns using evolutionary strategies and neural network (Q3163153) (← links)
• Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
• Two-dimensional profile-packing approach for multi-torch flame cutting (Q3605412) (← links)
• An object-based evolutionary algorithm for solving nesting problems (Q5444463) (← links)
• Layout optimization for the objects located within a rotating vessel -- a three-dimensional packing problem with behavioral constraints (Q5936135) (← links)
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)