Skip to main content
SpringerLink
Log in

Algorithmus 25 Verfahren zur gemischt-ganzzahligen, konvexen Optimierung

A method for mixed integer convex programming

  • Algorithmus
  • Published:
Computing Aims and scope Submit manuscript

Zusammenfassung

Diese Arbeit enthält ein ALGOL-Programm zur Lösung gemischt-ganzzahliger Optimierungsaufgaben mit konvexer Zielfunktion und konvexen Restriktionen nach einer Methode von Burkard [2].

Abstract

This paper contains an ALGOL-Procedure for solving mixed integer programming problems with convex objective function and constraints according to a method of Burkard [2].

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

Literatur

  1. Burkard, R. E.: Methoden der ganzzahligen Optimierung. Wien-New York: Springer. 1972.

    Google Scholar 

  2. Burkard, R. E.: A method for mixed-integer convex programming, in: Proceedings of the Fourth Conference of Probability Theory (Brasov, Sept. 1971). Bucureşti: Editura Academiei RSR. 1973.

    Google Scholar 

  3. Dakin, R. J.: A Tree Search Algorithm for Mixed Integer Programming Problems. Comp. J.8, 250–255 (1965/66).

    Article  Google Scholar 

  4. Land, A. H., Doig, A. G.: An Automatic Method of Solving Discrete Programming Problems. Econometrica28, 497–520 (1960).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Universität Köln, Weyertal 86-90, D-5000, Köln 41, Bundesrepublik Deutschland

    R. E. Burkard

  2. Institut für Angew. Mathematik, Universität Graz, Steyrergasse 17/V, A-8010, Graz, Österreich

    H. Enge

Authors
  1. R. E. Burkard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Enge
    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

Burkard, R.E., Enge, H. Algorithmus 25 Verfahren zur gemischt-ganzzahligen, konvexen Optimierung. Computing 14, 389–396 (1975). https://doi.org/10.1007/BF02253549

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation