Pages that link to "Item:Q415558"
From MaRDI portal
The following pages link to A tabu search algorithm for the covering design problem (Q415558):
Displaying 7 items.
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- A tabu search algorithm for the covering design problem (Q415558) (← links)
- Small covering designs by branch-and-cut (Q1411610) (← links)
- A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
- Variable neighborhood descent heuristic for covering design problem (Q2840773) (← links)
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays (Q2866118) (← links)
- A large neighbourhood search heuristic for covering designs (Q5382679) (← links)