Ebook: Combinatorial Optimization II

---

Content:
Front Matter....Pages -
Perfect triangle-free 2-matchings....Pages 1-7
On the structure of all minimum cuts in a network and applications....Pages 8-16
Clutter percolation and random graphs....Pages 17-25
The use of recurrence relations in computing....Pages 26-34
A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem....Pages 35-52
A problem of scheduling conference accommodation....Pages 53-57
Constructing timetables for sport competitions....Pages 58-67
The reconstruction of latin squares with applications to school timetabling and to experimental design....Pages 68-77
An algorithm for the single machine sequencing problem with precedence constraints....Pages 78-87
Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory....Pages 88-101
The distance between nodes for a class of recursive trees....Pages 102-110
Optimization problems arising from the incorporation of split values in search trees....Pages 111-120
Heuristic analysis, linear programming and branch and bound....Pages 121-134
Heuristic improvement methods: How should starting solutions be chosen?....Pages 135-142

---

Content:
Front Matter....Pages -
Perfect triangle-free 2-matchings....Pages 1-7
On the structure of all minimum cuts in a network and applications....Pages 8-16
Clutter percolation and random graphs....Pages 17-25
The use of recurrence relations in computing....Pages 26-34
A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem....Pages 35-52
A problem of scheduling conference accommodation....Pages 53-57
Constructing timetables for sport competitions....Pages 58-67
The reconstruction of latin squares with applications to school timetabling and to experimental design....Pages 68-77
An algorithm for the single machine sequencing problem with precedence constraints....Pages 78-87
Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory....Pages 88-101
The distance between nodes for a class of recursive trees....Pages 102-110
Optimization problems arising from the incorporation of split values in search trees....Pages 111-120
Heuristic analysis, linear programming and branch and bound....Pages 121-134
Heuristic improvement methods: How should starting solutions be chosen?....Pages 135-142
....