Hill-Climbing Algerithms for the Construction of Combinatorial Designs
- 1 January 1985
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Embedding partial steiner triple systems is NP-completeJournal of Combinatorial Theory, Series A, 1983
- A Fast Algorithm for Finding Strong StartersSIAM Journal on Algebraic Discrete Methods, 1981