Pages that link to "Item:Q322528"
From MaRDI portal
The following pages link to Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528):
Displaying 10 items.
- 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)
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
- Multi-trip time-dependent vehicle routing problem with time windows (Q2029965) (← links)
- Near optimal minimal convex hulls of disks (Q2046265) (← links)
- Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
- A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints (Q2157560) (← links)
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches (Q2184044) (← links)
- Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks (Q5270775) (← links)