scientific article; zbMATH DE number 637340

zbMATH Open0801.05021MaRDI QIDQ4304396FDOQ4304396

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

Publication date: 27 November 1994

Title of this publication is not available (Why is that?)

Recommendations

• New coverings oft-sets with (t + 1)-sets
• New constructions for covering designs
• Optimal covering designs: complexity results and new bounds
• Covering \(t\)-sets with \((t+2)\)-sets

zbMATH Keywords

simulated annealingupper boundcovering design

Mathematics Subject Classification ID

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

Cited In (15)

• Title not available (Why is that?)
• Constraint Orbital Branching
• General upper bounds on the minimum size of covering designs
• Scheduling sports competitions at multiple venues -- revisited
• Optimal covering designs: complexity results and new bounds
• The minimum likely column cover problem
• Towards a theory of intrusion detection
• A note on a symmetrical set covering problem: the lottery problem
• The designs of S-boxes by simulated annealing
• A multilevel cooperative tabu search algorithm for the covering design problem
• Upper bounds on the general covering numberC_λ(v,k,t,m)
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• A tabu search algorithm for the covering design problem
• Variable neighborhood descent heuristic for covering design problem
• A large neighbourhood search heuristic for covering designs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4304396)