×
Korte, B.; Krelle, W.; Oberhofer, W.

Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben. I. (German) Zbl 0172.43905

Unternehmensforsch. 13, 73-98 (1969).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0172.43905

Cited in 1 Review
Cited in 3 Documents

Keywords:

operations research
PDF BibTeX XML Cite
\textit{B. Korte} et al., Unternehmensforsch. 13, 73--98 (1969; Zbl 0172.43905)
Full Text: DOI
  • logo of hbz
  • logo of WorldCat

References:

[1] Balas, E.: An Additive Algorithm for Solving Linear Programs with Zero-One Variables. Operations Research,13, 1965, p. 517–549. · Zbl 0194.19903
[2] : Discrete Programmingly by the Filter Method. Operations Research,15, 1967, p. 915–957. · Zbl 0153.21401
[3] : A Note on the Branch-and-Bound Principle. Operations Research,16, 1968, p. 442–445. · Zbl 0186.24901
[4] Balinski, M. L.: Integer Programming: Methods, Uses, Computation. Management Science,12, 3, Nov. 1965, p. 253–313. · Zbl 0129.12004
[5] –: Some General Methods in Integer Programming. In:J. Abadie (ed.), Nonlinear Programming. Amsterdam, 1967, p. 223–247.
[6] Beale, E. M. L.: Survey of Integer Programming. Operational Research Quarterly,16, 1965, p. 219–228.
[7] Ben-Israel, A. andA. Charnes: On Some Problems of Diophantine Programming. Cahièrs du Centre d’Etudes de Récherche Operationelle (Brüssel),4, 1962, p. 215–280. · Zbl 0135.19906
[8] Brauer, K. M.: Binäre Optimierung (Dissertation). Univ. des Saarlandes. Saarbrücken 1968.
[9] Colville, A. R.: A Comparative Study on Nonlinear Programming Codes. IBM Technical Report No. 320-2949, 1968.
[10] Dakin, R. J.: A Tree-Search Algorithm for Mixed Integer Programming Problems. The Computer Journal,8, 1965/66, p. 250–255. · Zbl 0154.42004
[11] Dantzig, G. B.: On the Significance of Solving Linear Programming Problems with Some Integer Variables. Econometrica,28, 1960, p. 30–44. · Zbl 0089.16101
[12] –: Lineare Programmierung und Erweiterungen. Berlin, 1966.
[13] Echols, R. E. andL. Cooper: Solution of Integer Programming Problems by Direct Search. Journal of the Association for Computing Machinery,15, 1968, p. 75–84. · Zbl 0157.50204
[14] Freeman, R. J.: Computational Experience with a ’Balasian’ Integer Programming. Operations Research,14, 1966, p. 935–941.
[15] Gomory, R. E.: An Algorithm for Integer Solution to Linear Programs. In:R. L. Graves, andP. Wolfe (eds.), Recent Advances in Mathematical Programming. New York, 1963a, p. 269–302. · Zbl 0235.90038
[16] –: All-Integer Integer Programming Algorithm. In:J. F. Muth, andG. L. Thompson (eds.). Industrial Scheduling. Englewood Cliffs, 1963b, p. 193–206.
[17] Hadley, G.: Nonlinear and Dynamic Programming. London, 1964 (Deutsch: Würzburg, 1969). · Zbl 0179.24601
[18] Haldi, J.: Twenty-five Integer Programming Test Problems. Working Paper no. 43. Graduate School of Business. Stanford University, 1964.
[19] Hammer (Ivănescu), P. L. andS. Rudeanu: Boolean Methods in Operations Research and Related Areas. Ökonometrie und Unternehmensforschung, Bd. VII. Berlin, 1968.
[20] Jaeschke, G.: Branching and Bounding. Eine allgemeine Methode zur Lösung kombinatorischer Probleme. Ablauf- und Planungsforschung,5, 1964, p. 133–155.
[21] Korte, B. undW. Oberhofer: Zwei Algorithmen zur Lösung eines komplexen Reihenfolge-problems. Unternehmensforschung,12, 1968, p. 217–231. · Zbl 0167.18403
[22] Krelle, W.: Ganzzahlige Programmierungen. Theorie und Anwendungen in der Praxis. Unternehmensforschung,2, 1958, p. 161–175. · Zbl 0093.32802
[23] : Ganzzahlige nichtlineare Programmierung für trennbare Funktionen. In:R. Henn (Herausg.), Operations Research Verfahren, Bd. V, 1968, p. 220–236. · Zbl 0193.18802
[24] Künzi, H. P.: Zum heutigen Stand der nichtlinearen Optimierungstheorie. Unternehmensforschung,12, 1968, p. 1–22. · Zbl 0153.49102
[25] Land, A. H. andA. G. Doig: An Automatic Method of Solving Discrete Programming Problems. Econometrica,28, 1960, p. 497–520. · Zbl 0101.37004
[26] Lawler, E. L. andD. E. Wood: Branch-and-Bound Methods: A Survey. Operations Research,14, 1966, p. 699–719. · Zbl 0143.42501
[27] Lawler, E. L. andM. D. Bell: A Method for Solving Discrete Optimization Problems. Operations Research,14, 1966, p. 1098–1112.
[28] Lemke, C. E. andK. Spielberg: Direct Search Algorithms for Zero-One and Mixed-Integer Programming. Operations Research,15, 1967, p. 892–914. · Zbl 0168.18201
[29] Little, J. D. C., K. G. Murty, D. W. Sweeny, andC. Karel: An Algorithm for the Traveling Salesman Problem. Operations Research,11, 1963, p. 972–989. · Zbl 0161.39305
[30] Lutz, T.: Der Rechner-Katalog. Stuttgart, 1966.
[31] 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. Houston, 1968.
[32] Steiger, F.: Optimization of Swissair’s Crew Scheduling by an Integer Linear Programming Model. Proceedings of 5th AGIFORS (Airline Groups of IFORS) Symposium Chicago 1965.
[33] Steiger, F. andM. Niederer: Aircrew Scheduling by Integer Programming. Contributed Paper of IFIP Congress 68. Edinburgh, August 1968. Section System Planning.
[34] Young, R. D.: A Simplified Primal (All-Integer) Integer Programming Algorithm. Operations Research,16, 1968, p. 750–782. · Zbl 0157.50203
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.