Skip to main content
SpringerLink
Log in

Adjacency on polymatroids

  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper characterizes adjacency for extreme points of a polymatroid. Two extreme points of a polymatroid are adjacent if and only if they either differ in exactly one component or differ in exactly two components with the two components satisfying a certain ordering relation. A polynomial algorithm generates and lists all extreme points adjacent to a given extreme point of a polymatroid. Similar results hold for the core of a convex game.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Balas and M.W. Padberg, “On the set-covering problem”,Operations Research 20 (1972) 1152–1161.

    MATH  MathSciNet  Google Scholar 

  2. E. Balas and M. Padberg, “On the set-covering problem: II. an algorithm for set partitioning”,Operations Research 23 (1975) 74–90.

    MATH  MathSciNet  Google Scholar 

  3. E. Balas and M.W. Padberg, “Adjacent vertices of the all 0–1 programming polytope”,RAIRO-Operations Research 13 (1979) 3–12.

    MATH  MathSciNet  Google Scholar 

  4. M.L. Balinski and A. Russakoff, “Some properties of the assignment polytope”,Mathematical Programming 3 (1972) 257–258.

    Article  MATH  MathSciNet  Google Scholar 

  5. M.L. Balinski and A Russakoff, “On the assignment polytope”,SIAM Review 16 (1974) 516–525.

    Article  MATH  MathSciNet  Google Scholar 

  6. R.E. Bixby, W.H. Cunningham and D.M. Topkis, “The partial order of a polymatroid extreme point” (to appear inMathematics of Operations Research).

  7. V. Chvátal, “On certain polytopes associated with graphs”,Journal of Combinatorial Theory (B) 18 (1975) 138–154.

    Article  MATH  Google Scholar 

  8. V. Chvátal, “Rational behaviour and computational complexity”, Technical Report SOCS-78.9, School of Computer Science, McGill University (1978).

  9. W.H. Cunningham, “Testing membership in matroid polyhedra”, Working Paper WP-81207, Department of Operations Research, University of Bonn (1981).

  10. J. Edmonds, “Submodular functions, matroids, and certain polyhedra”, in R. Guy et al., eds.,Combinatorial structures and their applications (Proceedings Calgary International Conference, 1969) (Gordon and Breach, New York, 1970) pp. 69–87.

    Google Scholar 

  11. S. Fujishige, “Algorithms for solving the independent-flow problems”,Journal of the Operations Research Society of Japan 21 (1978) 189–204.

    MATH  MathSciNet  Google Scholar 

  12. P. Gaiha and S.K. Gupta, “Adjacent vertices on a permutohedron”,SIAM Journal on Applied Mathematics 32 (1977) 323–327.

    Article  MATH  MathSciNet  Google Scholar 

  13. R. Giles, “Adjacency on the postman polyhedron”,SIAM Journal on Algebraic and Discrete Methods 2 (1981) 172–175.

    Article  MATH  MathSciNet  Google Scholar 

  14. R. Giles and D. Hausmann, “Characterizations of adjacency on the branching polyhedron”,Discrete Mathematics 26 (1979) 219–226.

    Article  MATH  MathSciNet  Google Scholar 

  15. M. Grötschel, L. Lovász and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization”,Combinatorica 1 (1981) 169–197.

    Article  MATH  MathSciNet  Google Scholar 

  16. D. Hausmann, “Adjacency on polytopes in combinatorial optimization”, Mathematical Systems in Economics 49, Oelgeschlager, Gunn & Hain (Cambridge, Massachusetts, 1979).

    Google Scholar 

  17. D. Hausmann, “Complexity of the testing of adjacency on theb-matching polyhedron”,Operations Research Verfahren/Methods of Operations Research 32 (1979) 133–141.

    MATH  MathSciNet  Google Scholar 

  18. D. Hausmann, “Adjacent vertices on theb-matching polyhedron”,Discrete Mathematics 33 (1981) 37–51.

    Article  MATH  MathSciNet  Google Scholar 

  19. D. Hausmann and B. Korte, “Colouring criteria for adjacency on 0–1 polyhedra”,Mathematical Programming Study 8 (1978) 106–127.

    MathSciNet  Google Scholar 

  20. P.G. McKeown, “Determining adjacent vertices on assignment polytopes”,Naval Research Logistics Quarterly 23 (1976) 455–460.

    MATH  MathSciNet  Google Scholar 

  21. P.G. McKeown and D.S. Rubin, “Adjacent vertices on transportation polytopes”,Naval Research Logistics Quarterly 22 (1975) 365–374.

    MATH  MathSciNet  Google Scholar 

  22. K.G. Murty, “On the tours of a traveling salesman”,SIAM Journal on Control 7 (1969), 122–131.

    Article  MATH  MathSciNet  Google Scholar 

  23. K.G. Murty, “Adjacency on convex polyhedra”,SIAM Review 13 (1971) 377–386.

    Article  MATH  MathSciNet  Google Scholar 

  24. M.W. Padberg and M.R. Rao, “The traveling salesman problem and a class of polyhedra of diameter two”,Mathematical Programming 7 (1974) 32–45.

    Article  MATH  MathSciNet  Google Scholar 

  25. C.H. Papadimitriou, “The adjacency relation on the traveling salesman polytope is NP-complete”,Mathematical Programming 14 (1978) 312–324.

    Article  MATH  MathSciNet  Google Scholar 

  26. M.R. Rao, “Adjacency of the traveling salesman tours and 0–1 vertices”,SIAM Journal on Applied Mathematics 30 (1976) 191–198.

    Article  MathSciNet  MATH  Google Scholar 

  27. L.S. Shapley, “Cores of convex games”,International Journal of Game Theory 1 (1971) 11–26.

    Article  MATH  MathSciNet  Google Scholar 

  28. D.M. Topkis, “Activity selection games and the minimum-cut problem”,Networks 13 (1983) 93–105.

    MATH  MathSciNet  Google Scholar 

  29. H.P. Young, “On permutations and permutation polytopes”,Mathematical Programming Study 8 (1978) 128–140.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Bell Laboratories, 07733, Holmdel, NJ, USA

    Donald M. Topkis

Authors
  1. Donald M. Topkis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Topkis, D.M. Adjacency on polymatroids. Mathematical Programming 30, 229–237 (1984). https://doi.org/10.1007/BF02591887

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation