Table of Contents:
  • Front Cover; Studies on Graphs and Discrete Programming; Copyright Page; Foreword; Contents; Chapter 1. Integer and fractional matchings; Chapter 2. Packing problems; Chapter 3. Admissible transformations and their application to matching problems; Chapter 4. Polynomial algorithms for totally dual integral systems and extensions; Chapter 5. Minimal costreliability ratio spanning tree; Chapter 6. A graph theoretic analysis of bounds for the quadratic assignment problem; Chapter 7. An investigation of algorithms used in the restructuring of linear programming basis matrices prior to inversion
  • Includes bibliographical references