Skip to main content
  • Book
  • © 1978

Polyhedral Combiantorics

Part of the book series: Mathematical Programming Studies (MATHPROGRAMM, volume 8)

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (16 chapters)

  1. Front Matter

  2. Delbert Ray Fulkerson

    • Louis J. Billera, William F. Lucas
    Pages 1-16
  3. Notes on Bland’s pivoting rule

    • D. Avis, V. Chvátal
    Pages 24-34
  4. An algorithm for finding hamiltonian circuits in certain graphs

    • Robert E. Bixby, Da-Lun Wang
    Pages 35-49
  5. A primal algorithm for optimum matching

    • W. H. Cunningham, A. B. Marsh
    Pages 50-72
  6. An analysis of approximations for maximizing submodular set functions—II

    • M. L. Fisher, G. L. Nemhauser, L. A. Wolsey
    Pages 73-87
  7. Colouring criteria for adjacency on 0–1-polyhedra

    • Dirk Hausmann, Bernhard Korte
    Pages 106-127
  8. On permutations and permutation polytopes

    • H. P. Young
    Pages 128-140
  9. Some applications of equalized matrices

    • Zsolt Baranyai
    Pages 217-225
  10. Multicoloring of a graph

    • Claude Berge
    Pages 226-234

Bibliographic Information

  • Book Title: Polyhedral Combiantorics

  • Editors: M. L. Balinski, A. J. Hoffman

  • Series Title: Mathematical Programming Studies

  • DOI: https://doi.org/10.1007/BFb0121189

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1978

  • eBook ISBN: 978-3-642-00790-3Published: 07 March 2009

  • Series ISSN: 0303-3929

  • Series E-ISSN: 2364-8201

  • Edition Number: 1

  • Number of Pages: 234

  • Topics: Optimization, Mathematics of Computing