A Bridge Club Design

W. D. Wallis ()
Additional contact information
W. D. Wallis: Southern Illinois University, Department of Mathematics

Chapter Chapter 1 in Computational and Constructive Design Theory, 1996, pp 1-12 from Springer

Abstract: Abstract In this tutorial paper we consider a particular design problem which arose in scheduling a social bridge club consisting of twelve couples. At each meeting the club was divided into three groups of four couples, and each couple competed against each other couple in its group. The club met eight times, and it was required that each couple plays against each other couple two or three times. We have used this problem as a vehicle for exploring several techniques of design construction, some of which involve the application of methods more commonly used in continuous optimization problems.

Keywords: Simulated Annealing; Automorphism Group; Greedy Algorithm; Parallel Classis; Special Pair (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-2497-4_1

Ordering information: This item can be ordered from
http://www.springer.com/9781475724974

DOI: 10.1007/978-1-4757-2497-4_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().