Skip to main content
SpringerLink
Log in

On binary group problems having the Fulkerson property

  • Courses
  • Conference paper
  • First Online:
Combinatorial Optimization

Part of the book series: Lecture Notes in Mathematics ((LNMCIME,volume 1403))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Barahona, "The Max Cut Problem in Graphs not Contractible to K5," Operations Research Letters 2 (1983), 107–111.

    Article  Google Scholar 

  2. F. Barahona and M. Groetschel, "On the Cycle Polytope of a Binary Matroid," to appear in Journal of Combinatorial Theory.

    Google Scholar 

  3. S. Chopra, D.L. Jenson, and E.L. Johnson, "Polyhedra of Regular Binary Group Problems," IBM RC, IBM Watson Research Center, Yorktown Heights, NY 1986

    Google Scholar 

  4. S. Chopra and E.L. Johnson, "Dual Row Modules and Polyhedra of Blocking Group Problems," to appear in Mathematical Programming.

    Google Scholar 

  5. J. Edmonds and E.L. Johnson, "Matching, Euler Tours, and the Chinese Postman Problem," Mathematical Programming 5 (1973), 88–124.

    Article  Google Scholar 

  6. D.R. Fulkerson, "Networks, Frames, and Blocking Systems," in: G.B. Dantzig and A.F. Veinott, Jr. (eds.), Mathematics of the Decision Sciences, Part 1. AMS (1968), 303–334.

    Google Scholar 

  7. D.R. Fulkerson, "Blocking Polyhedra," in B. Harris (ed.), Graph Theory and its Applications, Academic Press, NY, 1970, 93–112.

    Google Scholar 

  8. G. Gastou and E.L. Johnson, "Binary Group and Chinese Postman Polyhedra," Mathematical Programming 34 (1986), 1–33.

    Article  Google Scholar 

  9. R.E. Gomory, "Some Polyhedra Related to Combinatorial Problems," Linear Algebra and Applications 2 (1969), 451–558.

    Article  Google Scholar 

  10. M. Groetschel and W.R. Pulleyblank, "Weakly Bipartite Graphs," Operations Research Letters 1 (1981), 23–27.

    Article  Google Scholar 

  11. M. Guan, "Graphic Programming Using Odd or Even Points," Chinese Mathematics 1 (1962), 273–277.

    Google Scholar 

  12. E.L. Johnson, "Integer Programming: Facets, Subadditivity, and Duality for Group and Semigroup Problems," CBMS-NSF Regional Conferences Series in Applied Mathematics 32 (Society for Industrial and Applied Mathematics) (1980), Philadelphia, PA.

    Google Scholar 

  13. E.L. Johnson and O. Marcotte, manuscript (1984).

    Google Scholar 

  14. E.L. Johnson and S. Mosterts, "Oh Four Problems in Graph Theory," to appear in SIAM Journal on Algebraic and Discrete Methods.

    Google Scholar 

  15. A. Lehman, "A Solution of the Shannon Switching Game," SIAM Journal of Applied Mathematics 12 (1964), 687–725.

    Article  Google Scholar 

  16. A. Lehman, "On the Width-Length Inequality," Mathematical Programming 16 (1979), 245–259.

    Article  Google Scholar 

  17. M. Padberg and M.R. Rao, "Odd Minimum Cuts and b-matching," Mathematics of Operations Research 7 (1982), 67–80.

    Article  Google Scholar 

  18. P.D. Seymour, "Matroids with the Max-flow Min-cut Property," Journal of Combinatorial Theory Series B 23 (1977), 189–222.

    Article  Google Scholar 

  19. P.D. Seymour, "Matroids and Multicommodity Flows," European Journal of Combinatorics 2 (1981), 257–290.

    Article  Google Scholar 

  20. W.T. Tutte, "Lectures on Matroids," Journal of Research of the National Bureau of Standards Section B 69 (1965), 1–47.

    Article  Google Scholar 

  21. H. Whitney, "On the Abstract Properties of Linear Dependence," American Journal of Mathematics 57 (1935), 509–533.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Thomas J. Watson Research Center, 10598, Yorktown Heights, NY

    Ellis L. Johnson

  2. Department of Applied Mathematics and Statistics, State University of New York at Stony Brook, 11794, Stony Brook, NY

    Ellis L. Johnson

Authors
  1. Ellis L. Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bruno Simeone

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag

About this paper

Cite this paper

Johnson, E.L. (1989). On binary group problems having the Fulkerson property. In: Simeone, B. (eds) Combinatorial Optimization. Lecture Notes in Mathematics, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083462

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51797-9

  • Online ISBN: 978-3-540-46810-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation