Rayward-Smith V.J. (ed.) Combinatorial Optimization II

Издательство North-Holland, 1980, -150 pp.In September 1977, the University of Liverpool organized the first British Conference on Combinatorial Programming. Called CP77, the conference attracted over forty delegates from both academic and industrial backgrounds and with diverse disciplines ranging from pure mathematics through engineering sciences to computing and business studies. So successful and stimulating was CP77 that it was decided to hold another conference on similar lines in 1979..
This proceedings consists of just a selection of the papers presented at the conference. The programme committee wishes to thank all the contributors for their work and the referees for their help in the difficult task of selecting the papers to be included in this proceedings. These papers reflect the major themes of the conference which included NP-hard problems, the design and analysis of heuristics and complexity theory. Contributions range from results in pure mathematics to applications to very practical problems.C079: Committee Members.
Perfect triangle-free 2-matchings.
On the structure of all minimum cuts in a network and applications.
Clutter percolation and random graphs.
The use of recurrence relations in computing.
A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem.
A problem of scheduling conference accommodation.
Constructing timetables for sport competitions.
The reconstruction of Latin squares with applications to school timetabling and experimental design.
An algorithm for the single machine sequencing problem with precedence constraints.
Finding k edge-disjoint spanning trees of minimum total weight in a network: an application of matroid theory.
The distance between nodes for a class of recursive trees.
Optimization problems arising from the incorporation of split values in search trees.
Heuristic analysis, linear programming and branch and bound.
Heuristic improvement methods: How should starting solutions be chosen?