Pages that link to "Item:Q2479825"
From MaRDI portal
The following pages link to Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825):
Displaying 13 items.
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
- A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
- A beam search algorithm for the circular packing problem (Q960400) (← links)
- Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← links)
- A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
- Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- Evolutionary computation solutions to the circle packing problem (Q2402110) (← links)
- Packing circles into perimeter-minimizing convex hulls (Q2423783) (← links)
- A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
- Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)