{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T19:09:18Z","timestamp":1775070558888,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1007\/bf02247879","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T04:16:20Z","timestamp":1132028180000},"page":"131-144","source":"Crossref","is-referenced-by-count":214,"title":["Computational aspects of a branch and bound algorithm for quadratic zero-one programming","Rechnerische Aspekte eines \u201cBranch and Bound\u201d-Algorithmus zur quadratischen Null-Eins-Programmierung"],"prefix":"10.1007","volume":"45","author":[{"given":"P. M.","family":"Pardalos","sequence":"first","affiliation":[]},{"given":"G. P.","family":"Rodgers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02247879_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(86)90065-X","volume":"13","author":"F. Barahona","year":"1986","unstructured":"Barahona, F., A Solvable Case of Quadratic 0\u20131 Programming, Discrete Applied Mathematics13 (1986), 23\u201326.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02247879_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F. Barahona","year":"1989","unstructured":"Barahona, F., J\u00fcnger, M., Reinelt, G., Experiments in Quadratic 0\u20131 Programming, Mathematical Programming44 (1989), 127\u2013137.","journal-title":"Mathematical Programming"},{"key":"BF02247879_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(84)90111-2","volume":"7","author":"M. W. Carter","year":"1984","unstructured":"Carter, M. W., The Indefinite Zero-One Quadratic Problem, Discrete Applied Mathematics7 (1984), 23\u201344.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02247879_CR4","first-page":"356","volume":"3","author":"M. Cooper","year":"1981","unstructured":"Cooper, M., A Survey of Methods for Pure Nonlinear Integer Programming, Management Science3 (1981), 356\u2013361.","journal-title":"Management Science"},{"key":"BF02247879_CR5","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0120892","volume":"12","author":"G. Gallo","year":"1980","unstructured":"Gallo, G., Hammer, P. L., Simeone, B., Quadratic Knapsack Problems, Mathematical Programming12 (1980), 132\u2013149.","journal-title":"Mathematical Programming"},{"key":"BF02247879_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(84)90055-9","volume":"15","author":"V. P. Gulati","year":"1984","unstructured":"Gulati, V. P., Gupta, S. K., Mittal, A. K., Unconstrained Quadratic Bivalent Programming Problem, European Journal of Operational Research,15 (1984), 121\u2013125.","journal-title":"European Journal of Operational Research"},{"key":"BF02247879_CR7","first-page":"418","volume":"20","author":"P. Hansen","year":"1984","unstructured":"Hansen, P., Hammer, P. L., Logical relations in quadratic 0\u20131 programming, Revue Roumaine de Mathematiques Pures et Appliques,20 (1984), 418\u2013427.","journal-title":"Revue Roumaine de Mathematiques Pures et Appliques"},{"issue":"2","key":"BF02247879_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02612354","volume":"28","author":"P. L. Hammer","year":"1984","unstructured":"Hammer, P. L., Hansen, P., Simeone, B., Roof Duality, Complementation, and Persistency in Quadratic 0\u20131 Optimization, Mathematical Programming,28(2), (1984), 121\u2013155.","journal-title":"Mathematical Programming"},{"key":"BF02247879_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0167-5060(08)70343-1","volume":"5","author":"P. Hansen","year":"1979","unstructured":"Hansen, P., Methods of Nonlinear 0\u20131 Programming, Annals of Discrete Mathematics5 (1979), 53\u201370.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02247879_CR10","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0377-2217(84)90054-7","volume":"15","author":"L. Shi Hui","year":"1984","unstructured":"Shi Hui, L., An Improved Enumerative Algorithm for Solving Quadratic Zero-One Programming, European Journal of Operational Research15 (1984), 110\u2013120.","journal-title":"European Journal of Operational Research"},{"key":"BF02247879_CR11","unstructured":"Jha, S., Pardalos, P. M., Graph Separation Techniques for Quadratic Zero-One Programming, Technical Report CS-87-39, Computer Science Department, The Pennsylvania State University (1987)."},{"key":"BF02247879_CR12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02253896","volume":"30","author":"F. K\u00f6rner","year":"1983","unstructured":"K\u00f6rner, F., An Efficient Branch and Bound Algorithm to Solve the Quadratic Integer Programming Problem, Computing30 (1983), 253\u2013260.","journal-title":"Computing"},{"key":"BF02247879_CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","volume":"9","author":"J. Krarup","year":"1978","unstructured":"Krarup, J., Pruza, P. A., Computer Aided Layout Design, Mathematical Programming Study9 (1978), 75\u201394.","journal-title":"Mathematical Programming Study"},{"issue":"2","key":"BF02247879_CR14","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1147\/sj.82.0136","volume":"8","author":"P. Lewis","year":"1969","unstructured":"Lewis, P., Goodman, A. S., Miller, J. M., Pseudo-Random Number Generator for the System\/360, IBM Systems Journal,8(2), (1969), 300\u2013312.","journal-title":"IBM Systems Journal"},{"issue":"3","key":"BF02247879_CR15","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","volume":"26","author":"R. D. McBride","year":"1980","unstructured":"McBride, R. D., Yormark, J. S., An Implicit Enumeration Algorithm for Quadratic Integer Programming, Management Science26(3) (1980), 282\u2013296.","journal-title":"Management Science"},{"key":"BF02247879_CR16","unstructured":"Pardalos, P. M., Construction of test problems in quadratic bivalent programming, To appear in ACM TOMS (1990)."},{"key":"BF02247879_CR17","unstructured":"Pardalos, P. M., Rodgers, G. P., Parallel branch and bound algorithms for unconstrained quadratic zero-one programming. In: Impacts of Recent Computer Advances on Operations Research, (eds R. Sharda et al. 1989), North-Holland, 131\u2013143."},{"key":"BF02247879_CR18","unstructured":"Pardalos, P. M., Rodgers, G. P., A branch and bound algorithm for the maximum clique problem, To appear in Mathematical Programming."},{"key":"BF02247879_CR19","series-title":"Lecture Notes in Computer Sciences","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0000035","volume-title":"Global Constrained Optimization: Algorithms and Applications","author":"P. M. Pardalos","year":"1987","unstructured":"Pardalos, P. M., Rosen, J. B., Global Constrained Optimization: Algorithms and Applications, Lecture Notes in Computer Sciences268 Berlin-Heidelberg-New York: Springer (1987)."},{"key":"BF02247879_CR20","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230050405","volume":"5","author":"J. C. Picard","year":"1974","unstructured":"Picard, J. C., Ratliff, H. D., Minimum Cuts and Related Problems, Networks5 (1974), 357\u2013370.","journal-title":"Networks"},{"key":"BF02247879_CR21","unstructured":"Rodgers, G. P. Algorithms for Unconstrained Quadratic 0\u20131 Programming and Related Problems on Contemporary Computer Architectures, Ph.D. Dissertation, The Pennsylvania State University, (1989)."},{"key":"BF02247879_CR22","unstructured":"Williams, A. C., Quadratic 0\u20131 Programming Using the Roof Dual with Computational Results, RUTCOR Research Report #8-85, The State University of New Jersey, (1985)."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02247879.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02247879\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02247879","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:41:18Z","timestamp":1558017678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02247879"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["BF02247879"],"URL":"https:\/\/doi.org\/10.1007\/bf02247879","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}