scientific article; zbMATH DE number 637340

zbMath0801.05021MaRDI QIDQ4304396

Kari J. Nurmela, Patric R. J. Östergård

Publication date: 27 November 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

upper boundsimulated annealingcovering design

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of packing and covering (05B40)

Related Items (11)

Upper bounds on the general covering numberC_λ(v,k,t,m) ⋮ Constraint Orbital Branching ⋮ A tabu search algorithm for the covering design problem ⋮ Scheduling sports competitions at multiple venues -- revisited ⋮ A note on a symmetrical set covering problem: the lottery problem ⋮ Optimal covering designs: complexity results and new bounds ⋮ A simulated annealing and hill-climbing algorithm for the traveling tournament problem ⋮ The minimum likely column cover problem ⋮ Variable neighborhood descent heuristic for covering design problem ⋮ General upper bounds on the minimum size of covering designs ⋮ Towards a Theory of Intrusion Detection

This page was built for publication: