caa a22 4500 465774458 CHVBK 20180323111938.0 cr unu---uuuuu 170327e19901201xx s 000 0 eng 10.1007/BF02283698 doi (NATIONALLICENCE)springer-10.1007/BF02283698 A note on adapting methods for continuous global optimization to the discrete case [Elektronische Daten] [Harold Benson, S. Selcuk Erenguc, Reiner Horst] In this note we show that various branch and bound methods for solving continuous global optimization problems can be readily adapted to the discrete case. As an illustration, we present an algorithm for minimizing a concave function over the integers contained in a compact polyhedron. Computational experience with this algorithm is reported. J.C. Baltzer A.G. Scientific Publishing Company, 1990 Discrete global optimization nationallicence nonlinear integer programming nationallicence branch and bound nationallicence Benson Harold University of Florida, 32611-2017, Gainesville, FL, USA aut Selcuk Erenguc S. University of Florida, 32611-2017, Gainesville, FL, USA aut Horst Reiner University of Trier, Trier, FRG aut Annals of Operations Research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers 25/1(1990-12-01), 243-252 0254-5330 25:1<243 1990 25 10479 https://doi.org/10.1007/BF02283698 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02283698 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Benson Harold University of Florida, 32611-2017, Gainesville, FL, USA aut NATIONALLICENCE 700 1- Selcuk Erenguc S. University of Florida, 32611-2017, Gainesville, FL, USA aut NATIONALLICENCE 700 1- Horst Reiner University of Trier, Trier, FRG aut NATIONALLICENCE 773 0- Annals of Operations Research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers 25/1(1990-12-01), 243-252 0254-5330 25:1<243 1990 25 10479 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer