caa a22 4500 465751814 CHVBK 20180323111836.0 cr unu---uuuuu 170327e19900601xx s 000 0 eng 10.1007/BF02247879 doi (NATIONALLICENCE)springer-10.1007/BF02247879 Computational aspects of a branch and bound algorithm for quadratic zero-one programming [Elektronische Daten] [P. Pardalos, G. Rodgers] Rechnerische Aspekte eines "Branch and Bound”-Algorithmus zur quadratischen Null-Eins-Programmierung In this paper we describe computational experience in solving unconstrained quadratic zero-one problems using a branch and bound algorithm. The algorithm incorporates dynamic preprocessing techniques for forcing variables and heuristics to obtain good starting points. Computational results and comparisons with previous studies on several hundred test problems with dimensions up to 200 demonstrate the efficiency of our algorithm. Springer-Verlag, 1990 Quadratic 0-1 programming nationallicence branch and bound nationallicence computation nationallicence test problems nationallicence Pardalos P. Department of Computer Science, The Pennsylvania State University, 16802, University Park, PA, USA aut Rodgers G. General Technology Division, IBM Corporation, 05452, Burlington, Vermont, USA aut Computing Springer-Verlag 45/2(1990-06-01), 131-144 0010-485X 45:2<131 1990 45 607 https://doi.org/10.1007/BF02247879 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02247879 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Pardalos P. Department of Computer Science, The Pennsylvania State University, 16802, University Park, PA, USA aut NATIONALLICENCE 700 1- Rodgers G. General Technology Division, IBM Corporation, 05452, Burlington, Vermont, USA aut NATIONALLICENCE 773 0- Computing Springer-Verlag 45/2(1990-06-01), 131-144 0010-485X 45:2<131 1990 45 607 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer