Pages that link to "Item:Q628047"

The following pages link to A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms (Q628047):

Displaying 17 items.

• Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← links)
• Constrained order packing: comparison of heuristic approaches for a new bin packing problem (Q300978) (← links)
• A hybrid algorithm for constrained order packing (Q301159) (← links)
• An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
• Algorithms for nesting with defects (Q406491) (← links)
• Irregular stock cutting system based on AutoCAD (Q654369) (← links)
• A beam search implementation for the irregular shape packing problem (Q964846) (← links)
• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
• A cutting stock problem and its solution in the manufacturing industry of large electric generators (Q1777147) (← links)
• A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems (Q1992380) (← links)
• Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← 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)
• Dynamic programming algorithms for generating optimal strip layouts (Q2506184) (← links)
• Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors (Q2569094) (← links)
• A hybrid approach for packing irregular patterns using evolutionary strategies and neural network (Q3163153) (← links)