
×
Combinatorial Optimization II
herausgegeben von Victor J. Rayward-SmithInhaltsverzeichnis
- 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 to 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?.