Advertisement

Colouring criteria for adjacency on 0–1-polyhedra

  • Dirk Hausmann
  • Bernhard Korte
Chapter
Part of the Mathematical Programming Studies book series (MATHPROGRAMM, volume 8)

Abstract

The adjacency of two vertices on an arbitrary 0–1-polyhedron P is characterized by certain criteria involving the (prime) implicants of P, which are generalizations of the circuits of an independence system. These criteria can be checked by straightforward “colouring algorithms”. They are sufficient for all 0–1-polyhedra and necessary for at least three classes containing the polyhedra of many well-known discrete optimization problems, e.g. the vertex packing problem, set packing problem, vertex covering problem, matching problem, assignment problem, partitioning problem, linear ordering problem, partial ordering problem.

Key words

Adjacency Assignment Colouring Algorithm Discrete Optimization Linear Ordering Matching Partitioning Prime Implicants Set Packing Vertex Packing Vertex Covering 0–1-polyhedra 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M.L. Balinski and A. Russakoff, “On the assignment polytope”, SIAM Review 16 (1974) 516–525.MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    V. Chvátal, “On certain polytopes associated with graphs”, Journal of Combinatorial Theory, B18 (1975) 138–154.MATHCrossRefGoogle Scholar
  3. [3]
    P.C. Gilmore and A.J. Hoffmann. “A characterization of comparability graphs and of interval graphs”, Canadian Journal of Mathematics 16 (1964) 539–548.MATHGoogle Scholar
  4. [4]
    M.W. Padberg and M.R. Rao, “The travelling salesman problem and a class of polyhedra of diameter two”, Mathematical Programming 7 (1974) 32–45.MATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    M.R. Rao, “Adjacency of the traveling salesman tours and 0–1 vertices”, SIAM Journal on Applied Mathematics 30 (1976) 191–198.MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    R. von Randow, Introduction to the theory of matroids (Springer, Berlin, Heidelberg, New York, 1975).MATHGoogle Scholar
  7. [7]
    D.J.A. Welsh: Matroid theory (Academic Press, London, New York, San Francisco, 1976).MATHGoogle Scholar

Copyright information

© The Mathematical Programming Society 1978

Authors and Affiliations

  • Dirk Hausmann
    • 1
  • Bernhard Korte
    • 1
  1. 1.University of BonnBonnGermany

Personalised recommendations