no. 1
An efficient method for obtaining sharp bounds for nonlinear boolean programming problems
RAIRO - Operations Research - Recherche Opérationnelle, Tome 26 (1992) no. 1, pp. 113-120. 
@article{RO_1992__26_1_113_0,
     author = {K\"orner, P. F.},
     title = {An efficient method for obtaining sharp bounds for nonlinear boolean programming problems},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {113--120},
     publisher = {EDP-Sciences},
     volume = {26},
     number = {1},
     year = {1992},
     mrnumber = {1162707},
     zbl = {0764.90058},
     language = {en},
     url = {http://www.numdam.org/item/RO_1992__26_1_113_0/}
}
TY  - JOUR
AU  - Körner, P. F.
TI  - An efficient method for obtaining sharp bounds for nonlinear boolean programming problems
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1992
SP  - 113
EP  - 120
VL  - 26
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_1992__26_1_113_0/
LA  - en
ID  - RO_1992__26_1_113_0
ER  - 
%0 Journal Article
%A Körner, P. F.
%T An efficient method for obtaining sharp bounds for nonlinear boolean programming problems
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1992
%P 113-120
%V 26
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/RO_1992__26_1_113_0/
%G en
%F RO_1992__26_1_113_0
Körner, P. F. An efficient method for obtaining sharp bounds for nonlinear boolean programming problems. RAIRO - Operations Research - Recherche Opérationnelle, Tome 26 (1992) no. 1, pp. 113-120. http://www.numdam.org/item/RO_1992__26_1_113_0/

1. M. S. Bazaraa and J. J. Goode, A Survey of Various Tactics for Generating Lagrange Multipliers, Eur. J. Oper. Res., 1979, 3, pp. 322-338. | MR | Zbl

2. R. Fletcher, Practical Methods of Optimization, John Wiley, Chichester, 1981. | MR | Zbl

3. F. Forgo, Nemkonvex es diskret prograozas, Közgazdasagi es Jogi Könyvkiado, 1978.

4. P. L. Hammer, Boolean Elements in Combinatorial Optimization a Survey, in B. Roy Ed., Combinatorial programming: Methods and Appl., Reidel, Dortrecht, 1975, pp. 67-92. | MR | Zbl

5. P. Hansen, Quadratic zero-one programming by implicit emimeration in F. A. Lootsma Ed., Numerical methods in nonlinear optimization, Academic Press, New York, 1972, pp. 265-278. | MR | Zbl

6. P. Hansen, Methods of nonlinear 0-1 programming, Ann. Discrete Math., 1979, 5, pp. 53-70. | MR | Zbl

7. K. Hartmann, Verfahren zur Lösung ganzzahliger nichtlinearer Optimierungsprobleme, MOS, Series Optimization, 1977, 8, pp. 633-647. | MR | Zbl

8. F. Körner, An Efficient Branch and Bound Algorithm to Solve the Quadratic Integer Programming Problem, Computing, 1983, 30, pp. 253-260. | MR | Zbl

9. F. Körner and C. Richter, Zur effektiven Lösung von booleschen quadratischen Optimierungsproblemen, Num. Math., 1982, 40, pp. 99-109. | EuDML | MR | Zbl

10. F. Körner, A Tigth Bound for the Boolean Quadratic Optimization Problem and its use in a Branch and Bound Algorithm, Optimization, 1988, 19, pp. 711-721. | MR | Zbl

11. B. Kalantari and J. B. Rosen, Penalty Formulation for Zero-One Nonlinear Programming, Discrete Appl. Math., 1987, 16, pp. 179-182. | MR | Zbl

12. W. Oettly, Einzelschrittverfahren zur Lösung konvexer und dual-konvexer Minimierungsprobleme, Z.A.M.M., 1974, 54, pp. 343-351. | MR | Zbl

13. M. Sinclair, An Exact Penalty Function approach for Nonlinear Integer Programming Problems, Eur. J. Oper. Res., 1986, 27, pp. 50-56. | MR | Zbl