Skip to main content

Some combinatorial applications of the new linear programming algorithm

Special Invited Addresses

  • 1065 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 885)

Keywords

  • Polynomial Time
  • Combinatorial Optimization Problem
  • Combinatorial Problem
  • Polynomial Algorithm
  • Submodular Function

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.95
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Edmonds, Maximum matching and a polyhedron with 0,1-vertices, J. Res. Nat. Bur. Stan. B 69(1965), 125–130.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. J. Edmonds, Optimum branchings, J. Res. Nat. Bur. Stan. B 71(1967), 233–240.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. J. Edmonds, Submodular functions, matroids, and certain polyhedra, in: Combinatorial Structures and their Appl. (Proc. Intern. Conf. Calgary, 1969 R. Guy, H. Hanani, N. Sauer, J. Schönheim, eds.), Gordon and Breach, N.Y. 1970, 69–87.

    Google Scholar 

  4. J. Edmonds, Edge-disjoint branchings, in: Combinatorial Algorithms (Courant Comp. Sci. Symp. Monterey, 1972; R. Rustin, ed.) Academic Press, N.Y. 1973, 91–96.

    Google Scholar 

  5. J. Edmonds, Matroid intersection, Annals of Disctrete Math., 4 (1979), 39–49.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. J. Edmonds and R. Giles, A min-max relation for submodular functions on graphs, Annals of Discrete Math., 1 (1977), 185–204.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. J. Edmonds and E.L. Johnson, Matching, Euler tours, and the Chinese postman, Math. Prog., 5 (1973), 88–124.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton Univ. Press, Princeton, N.J. 1962.

    MATH  Google Scholar 

  9. A. Frank, Kernel systems of directed graphs, Acta Sci. Math. Szeged 41 (1979), 63–76.

    MathSciNet  MATH  Google Scholar 

  10. A. Frank, How to make a digraph strongly connected? Combinatorica (submitted).

    Google Scholar 

  11. D.R. Fulkerson, Packing rooted directed cuts in weighted directed graphs, Math. Prog., 6 (1974), 1–13.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. D.R. Fulkerson, Anti-blocking polyhedra, J. Combinatorial Theory, B 12 (1972), 50–71.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. P. Gács and L. Lovász, Khachiyan’s algorithm for linear programming, Math. Prog. Studies (submitted).

    Google Scholar 

  14. M. Grötschel, L. Lovász and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica (submitted).

    Google Scholar 

  15. A.V. Karzanov, On the minimal number of arcs of a digraph meeting all its directed cut sets. (To appear).

    Google Scholar 

  16. L.G. Khachiyan, A polynomial algorithm in linear programming, Dokl. Akad. Nauk SSSR 244 (1979), 1093–1096.

    MathSciNet  MATH  Google Scholar 

  17. E.L. Lawler, Optimal matroid intersections, in: Combinatorial Structures and their Applications (Proc. Intern. Conf. Calgary, 1969; R. Guy, H. Hanani, N. Sauer, J. Schönheim, eds.), Gordon and Breach, N.Y. 1970, 233–235.

    Google Scholar 

  18. L. Lovász, On the Shannon capacity of a graph, IEEE Trans. on Inf. Theory, 25 (1979), 1–7.

    CrossRef  MathSciNet  MATH  Google Scholar 

  19. C.L. Lucchesi, A minimax equality for directed graphs, Thesis, University of Waterloo, 1976.

    Google Scholar 

  20. C.L. Lucchesi and D.H. Younger, A minimax relation for directed graphs, J. London Math. Soc., 17 (1978), 369–374.

    CrossRef  MathSciNet  MATH  Google Scholar 

  21. M.W. Padberg and M.R. Rao, Minimum cut-sets and b-matchings, (to appear).

    Google Scholar 

  22. N.Z. Shor, Convergence rate of the gradient desent method with dilatation of the space, Kibernetika 2 (1970), 80–85.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Lovasz, L., Schriver, A. (1981). Some combinatorial applications of the new linear programming algorithm. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092253

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11151-1

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

  • eBook Packages: Springer Book Archive