Abstract
A University hall of residence consists of a number of buildings, or houses, which are used during vacations to accommodate the delegates to conferences held at the University. For brevity, the totality of delegates attending a conference will be referred to as the conference.
As conference bookings are made, the conferences are assigned to the houses in which they will be accommodated. The problem studied in this paper is that of keeping to a minimum for each conference the number of different houses in which delegates of that conference are accommodated.
The model adopted is one in which all the bookings for the period under consideration are known at the start of the period and the problem is to make the assignments of conferences to accommodation in such a way as to maximuse the utility under the compactness criterion.
Preview
Unable to display preview. Download preview PDF.
References
N.A.J. Hastings and J.B. Peacock, Statistical distributions (Bullerworths, London, 1974).
D.E. Knuth, The art of computer programming. Volume 1: fundamental algorithms (Addison Wesley, Reading, MA, 1968).
N.J. Nilsson, Problem solving methods in artificial intelligence (McGraw-Hill, New York, 1971).
A.J. Scott, Combinatorial programming, spatial analysis and planning (Methuen, London, 1971).
P.D. Stephens, “The IMP language and compiler,” Computer Journal 17 (1974) 216–233.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 The Mathematical Programming Society
About this chapter
Cite this chapter
Hinxman, A.I. (1980). A problem of scheduling conference accommodation. In: Rayward-Smith, V.J. (eds) Combinatorial Optimization II. Mathematical Programming Studies, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120906
Download citation
DOI: https://doi.org/10.1007/BFb0120906
Received:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00803-0
Online ISBN: 978-3-642-00804-7
eBook Packages: Springer Book Archive