Skip to main content
SpringerLink
Log in

Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben

  • Abhandlungen
  • Published:
Unternehmensforschung Aims and scope Submit manuscript

Zusammenfassung

Die Effizienz des von den Verfassern entwickelten lexikographischen Suchalgorithmus wird an Hand von weiteren Testbeispielen dargestellt. Außerdem werden die inzwischen mit anderen Verfahren erzielten Resultate nachgetragen.

Summary

The efficiency of the lexicographic search algorithm which was developed by the authors is pointed out by means of further test problems. Results of other methods which have become known to us in the meantime have been added.

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

Literaturverzeichnis

  • Brauer, K. M.: Binäre Optimierung (Dissertation). Univ. des Saarlandes. Saarbrücken 1968.

  • Freeman, R. J.: Computational Experience with a “Balasian” Integer Programming. Operations Research,14, 1966, p. 935–941.

    Google Scholar 

  • Geoffrion, A. M.: An Improved Implicite Enumeration Approach for Integer Programming. Rand Memorandum RM-5644-PR, Juni 1968.

  • Haldi, J.: Twenty-five Integer Programming Test Problems. Working Paper no. 43. Graduate School of Business. Stanford University, 1964.

  • —— undL. M. Isaacson: A Computer Code for Integer Solutions to Linear Programs. Operations Research,13, 1965, p. 946–956, SHARE Distribution Number 3335, SC LIP 1.

    Google Scholar 

  • Keydata Corporation: Computer Characteristics Review (Adams Quarterly). Vol. 9, no. 1, April 1969.

  • Korte, B., W. Krelle undW. Oberhofer: Ein lexikographischer Suchalgorithmus zur Lösung all-gemeiner ganzzahliger Programmierungsaufgaben. Unternehmensforschung,13, 1969, Teil I, p. 73–98, Teil II, p. 171–192.

    Google Scholar 

  • Krolak, P. D.: Computational Results of an Integer Programming Algorithm. Operations Research,17, 1969, p. 743–749.

    Google Scholar 

  • Lemke, C. E. andK. Spielberg: Direct Search Algorithms for Zero-One and Mixed-Integer Programming. Operations Research,15, 1967, p. 892–914.

    Google Scholar 

  • Levitan, R. E.: Integer Programming 3, 7090, IPM 3 SHARE Distribution Number 1190, September 1961.

  • Mears, W. J. andG. S. Dawkins: Comparison of Integer Programming Algorithms. Paper presented at the 1968 Joint National Meeting of ORSA and TIMS at San Francisco, May 1–3, 1968, Huston, 1968.

  • Trauth, C. A. andR. E. Woolsey: Integer Linear Programming: A Study in Computational Efficiency. Management Science,15, 1969, p. 481–493.

    Google Scholar 

  • Woilers, S.: Implicit Enumeration Algorithms for Discrete Optimization Problems. Ph.D. Dissertation, Department of Industrial Engineering, Stanford University, May 1967.

Download references

Author information

Authors and Affiliations

  1. Institut für Gesellschafts- und Wirtschaftswissenschaften, Adenauerallee 24–42, 53 Bonn

    Wilhelm Krelle

  2. Forschungsgruppe für Operations Research und Ökonometrie, Endenicher Allee 50, 53 Bonn

    Bernhard Korte &  Walter Oberhofer

Authors
  1. Wilhelm Krelle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Walter Oberhofer
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Nachtrag

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krelle, W., Korte, B. & Oberhofer, W. Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben. Unternehmensforschung Operations Research 14, 228–234 (1970). https://doi.org/10.1007/BF01918269

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation