Pages that link to "Item:Q2643959"
From MaRDI portal
The following pages link to A dynamic adaptive local search algorithm for the circular packing problem (Q2643959):
Displaying 10 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 beam search algorithm for the circular packing problem (Q960400) (← links)
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container (Q1651580) (← 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)
- Near optimal minimal convex hulls of disks (Q2046265) (← links)
- Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
- Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)