Pages that link to "Item:Q1266576"
From MaRDI portal
The following pages link to On genetic algorithms for the packing of polygons (Q1266576):
Displaying 29 items.
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces (Q2488910) (← links)
- A new heuristic recursive algorithm for the strip rectangular packing problem (Q2489283) (← links)
- Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle (Q2508197) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem (Q2643950) (← links)
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem (Q2643953) (← links)
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic (Q2643955) (← links)
- Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations (Q2669649) (← links)
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry (Q2803270) (← links)
- An improved best-fit heuristic for the orthogonal strip packing problem (Q2862160) (← links)
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes (Q3044033) (← links)
- A Hybrid Genetic Algorithm for Two Types of Polygonal Approximation Problems (Q3063016) (← links)
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network (Q3163153) (← links)
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces (Q3401326) (← links)
- Analysis of distributed genetic algorithms for solving cutting problems (Q3422369) (← links)
- Two-dimensional profile-packing approach for multi-torch flame cutting (Q3605412) (← links)
- Applying genetic algorithms and neural networks to the container loading problem (Q4469156) (← links)
- An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization (Q5438610) (← links)
- A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study (Q5945206) (← links)
- Data set generation for rectangular placement problems (Q5945856) (← links)
- A fast implementation for the 2D/3D box placement problem (Q5963685) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← 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)
- Packaging optimization using the dynamic vector fields method (Q6554510) (← links)
