Polyhedral Combiantorics

Bibliographic Details
Other Authors: Balinski, Michel L. (Editor), Hoffman, A. J. (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1978, 1978
Edition:1st ed. 1978
Series:Mathematical Programming Studies
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • Delbert Ray Fulkerson
  • D.R. Fulkerson’s contributions to polyhedral combinatorics
  • Notes on Bland’s pivoting rule
  • An algorithm for finding hamiltonian circuits in certain graphs
  • A primal algorithm for optimum matching
  • An analysis of approximations for maximizing submodular set functions—II
  • A practical algorithm for the Menger-type generalization of the independent assignment problem
  • Colouring criteria for adjacency on 0–1-polyhedra
  • On permutations and permutation polytopes
  • Symmetric blocking and anti-blocking relations for generalized circulations
  • Elementary vectors and two polyhedral relaxations
  • Support functions, blocking pairs, and anti-blocking pairs
  • On lattice polyhedra III: Blockers and anti-blockers of lattice clutters
  • Adjoints of projective transformations and face-figures of convex polytopes
  • Some applications of equalized matrices
  • Multicoloring of a graph