Pages that link to "Item:Q2253497"
From MaRDI portal
The following pages link to Iterated tabu search for the circular open dimension problem (Q2253497):
Displayed 13 items.
- Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082) (← links)
- Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem (Q306092) (← links)
- Tabu search for the real-world carpooling problem (Q306096) (← links)
- 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)
- An action-space-based global optimization algorithm for packing circles into a square container (Q337511) (← links)
- Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium (Q1618475) (← 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)
- Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
- Adaptive simulated annealing with greedy search for the circle bin packing problem (Q2147115) (← links)
- A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints (Q2157560) (← links)
- Optimized packing clusters of objects in a rectangular container (Q2298400) (← links)