Skip to main content
SpringerLink
Log in

Algorithmen für lineare Optimierung

  • Chapter
  • First Online:
Kombinatorische Optimierung

Part of the book series: Springer-Lehrbuch Masterclass ((MASTERCLASS))

  • 7127 Accesses

Zusammenfassung

Drei Typen von Algorithmen für die LINEARE OPTIMIERUNG hatten die größte Auswirkung, nämlich der SIMPLEXALGORITHMUS (siehe Abschnitt 3.2), die Innere-Punkte-Algorithmen und die ELLIPSOIDMETHODE.

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 39.95
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bland, R.G., Goldfarb, D., Todd, M.J.: The ellipsoid method: a survey. Operations Research 29, 1039–1091 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  2. Edmonds, J.: Systems of distinct representatives and linear algebra. Journal of Research of the National Bureau of Standards B 71, 241–245 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  3. Frank, A., Tardos, É.: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica 7, 49–65 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gács, P., Lovász, L.: Khachiyan's algorithm for linear programming. Mathematical Programming Study 14, 61–68 (1981)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Iudin, D.B., Nemirovskii, A.S.: Informational complexity and effective methods of solution for convex extremal problems. Ekonomika i Matematicheskie Metody 12, 357–369 (1976) [auf Russisch]

    MathSciNet  Google Scholar 

  7. Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373–395 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  8. Karp, R.M., Papadimitriou, C.H.: On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing 11, 620–632 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  9. Khachiyan, L.G.: A polynomial algorithm in linear programming [auf Russisch]. Doklady Akademii Nauk SSSR 244, 1093–1096 (1979). English translation: Soviet Mathematics Doklady 20, 191–194 (1979)

    Google Scholar 

  10. Khintchine, A.: Kettenbrüche. Teubner, Leipzig (1956)

    MATH  Google Scholar 

  11. Padberg, M.W., Rao, M.R.: The Russian method for linear programming III: Bounded integer programming. Research Report 81-39, New York University (1981)

    Google Scholar 

  12. Shor, N.Z.: Cut-off method with space extension in convex programming problems. Cybernetics 13, 94–96 (1977)

    Google Scholar 

  13. Steinitz, E.: Polyeder und Raumeinteilungen. Enzyklopädie der Mathematischen Wissenschaften, Band 3, 1–139 (1922)

    Google Scholar 

  14. Tardos, É.: A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34, 250–256 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  15. Vaidya, P.M.: A new algorithm for minimizing convex functions over convex sets. Mathematical Programming 73, 291–341 (1996)

    MathSciNet  MATH  Google Scholar 

Weiterführende Literatur

  1. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)

    Book  MATH  Google Scholar 

  2. Padberg, M.: Linear Optimization and Extensions, 2. Aufl. Springer, Berlin (1999)

    MATH  Google Scholar 

  3. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)

    MATH  Google Scholar 

Download references

Author information

Author notes

  1. Bernhard Korte & Jens Vygen

    Present address: Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Lennestr. 2, 53113, Bonn, Deutschland

Authors and Affiliations

    Authors
    1. Bernhard Korte
      View author publications

      You can also search for this author in PubMed Google Scholar

    2. Jens Vygen
      View author publications

      You can also search for this author in PubMed Google Scholar

    Corresponding authors

    Correspondence to Bernhard Korte or Jens Vygen .

    Rights and permissions

    Reprints and permissions

    Copyright information

    © 2012 Springer-Verlag Berlin Heidelberg

    About this chapter

    Cite this chapter

    Korte, B., Vygen, J. (2012). Algorithmen für lineare Optimierung. In: Kombinatorische Optimierung. Springer-Lehrbuch Masterclass. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25401-7_4

    Download citation

    Publish with us

    Policies and ethics

    Search

    Navigation