Pages that link to "Item:Q1847183"

The following pages link to An algorithm for polygon placement using a bottom-left strategy (Q1847183):

Displaying 16 items.

• An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems (Q610988) (← links)
• Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory (Q857327) (← 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)
• A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
• A 2-exchange heuristic for nesting problems (Q1847180) (← 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)
• Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
• Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry (Q2803270) (← links)
• Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
• Intelligent layout planning for rapid prototyping (Q3541168) (← links)
• Packing Optimization of Free-Form Objects in Engineering Design (Q4634971) (← links)
• An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization (Q5438610) (← links)
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)