Front Cover

pp.：  1 – 4

Bonn Workshop on Combinatorial Optimization

pp.：  4 – 5

Copyright Page

pp.：  5 – 7

Preface

pp.：  6 – 7

Contents

pp.：  7 – 6

List of Participants

pp.：  7 – 12

Chapter 1. Parity graphs

pp.：  12 – 38

Chapter 2. The travelling salesman polytope and {0,2}-matchings

pp.：  38 – 68

Chapter 3. Polyhedra for composed independence systems

pp.：  68 – 80

Chapter 3. Augmenting paths and a class of independence systems

pp.：  80 – 94

Chapter 4. Transformations which preserve perfectness and h-perfectness of graphs

pp.：  94 – 108

Chapter 5. An algorithm for submodular functions on graphs

pp.：  108 – 132

Chapter 6. Optimal subtrees and extensions

pp.：  132 – 140

Chapter 7. Cycles through prescribed and forbidden point sets

pp.：  140 – 160

Chapter 8. An efficient primal simplex algorithm for maximum weighted vertex packing on bipartite graphs

pp.：  160 – 180

Chapter 9. Degree-two inequalities, clique facets, and biperfect graphs

pp.：  180 – 200

Chapter 10. Flow network formulations of polymatroid optimization problems

pp.：  200 – 212

Chapter 11. Two lines least squares

pp.：  212 – 224

Chapter 12. Bounding the independence number of a graph

pp.：  224 – 236

Chapter 13. Scheduling problems with a singular solution

pp.：  236 – 252

Chapter 14. Ear decompositions of elementary graphs and GF2-rank of perfect matchings

pp.：  252 – 272

Chapter 15. Min–max relations for directed graphs

pp.：  272 – 292

Chapter 16. The bandwidth problem: critical subgraphs and the solution for caterpillars

pp.：  292 – 298

Chapter 17. Minimization of some nonlinear functions over polymatroidal network flows

pp.：  298 – 324