Pages that link to "Item:Q1569799"

The following pages link to TOPOS -- A new constructive algorithm for nesting problems (Q1569799):

Displaying 27 items.

• TOPOS (Q14750) (← links)
• Algorithms for nesting with defects (Q406491) (← links)
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming (Q819074) (← links)
• Heuristics for a dynamic rural postman problem (Q883291) (← links)
• Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet (Q948647) (← links)
• A beam search implementation for the irregular shape packing problem (Q964846) (← links)
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem (Q1040080) (← links)
• A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
• A customized branch-and-bound approach for irregular shape nesting (Q1668808) (← links)
• Dealing with nonregular shapes packing (Q1718651) (← links)
• A 2-exchange heuristic for nesting problems (Q1847180) (← links)
• An algorithm for polygon placement using a bottom-left strategy (Q1847183) (← links)
• A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems (Q1992380) (← links)
• A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (Q2116899) (← 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)
• Raster penetration map applied to the irregular packing problem (Q2312355) (← links)
• Exact approaches for the cutting path determination problem (Q2329729) (← links)
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
• An improved typology of cutting and packing problems (Q2643945) (← links)
• Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
• Packing Problems in Space Solved by CPLEX: An Experimental Analysis (Q3133910) (← 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)
• A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands (Q6060670) (← links)
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)
• An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects (Q6106774) (← links)