An efficient branch and bound algorithm to solve the quadratic integer programming problem. (English) Zbl 0494.65035


65K05 Numerical mathematical programming methods
90C10 Integer programming
Full Text: DOI


[1] Burkard, R. E.: Methoden der ganzzahligen Optimierung. Wien-New York: Springer 1972. · Zbl 0237.90042
[2] Charalambous, Ch.: Discrete optimization. Int. J. Systems Sci.5, 889–894 (1974). · Zbl 0296.90032 · doi:10.1080/00207727408920147
[3] Hartmann, K.: Verfahren zur Lösung ganzzahliger nichtlinearer Optimierungsprobleme. Math. Oper. Statistik. Optimization8, 633–647 (1977). · Zbl 0388.90048
[4] Jeroslow, R. G.: There cannot be any algorithm for integer programming with quadratic constraints. Oper. Res.21, 221–224 (1973). · Zbl 0257.90029 · doi:10.1287/opre.21.1.221
[5] Körner, F.: Untersuchungen über eine günstige Verzweigungsreihenfolge der Variablen bei Branchand-Bound-Verfahren. Math. Oper. Statistik. Optimization13, 221–229 (1982).
[6] Noltemeier, H.: Ein Branch-and-Bound-Verfahren-Generator. Computing8, 99–106 (1971). · Zbl 0226.90032 · doi:10.1007/BF02234046
[7] Panne. C. van de: Methods for linear and quadratic programming. American Elsevier 1975. · Zbl 0348.90094
[8] Zielke, G.: Numerische Berechnung von benachbarten inversen Matrizen und linearen Gleichungssystemen. Braunschweig: Vieweg 1970. · Zbl 0191.15703
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.