{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:48:24Z","timestamp":1752360504708},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"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":[[1995,12]]},"DOI":"10.1007\/bf02238228","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T17:27:19Z","timestamp":1131989239000},"page":"283-301","source":"Crossref","is-referenced-by-count":21,"title":["A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming"],"prefix":"10.1007","volume":"54","author":[{"given":"G.","family":"Palubeckis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02238228_CR1","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. Math. Programm.44, 127\u2013137 (1989).","journal-title":"Math. Programm."},{"key":"BF02238228_CR2","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. Discr. Appl. Math.7, 23\u201344 (1984).","journal-title":"Discr. Appl. Math."},{"key":"BF02238228_CR3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M. Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Programm.45, 59\u201396 (1989).","journal-title":"Math. Programm."},{"key":"BF02238228_CR4","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. Eur. J. Oper. Res.15, 121\u2013125 (1984).","journal-title":"Eur. J. Oper. Res."},{"key":"BF02238228_CR5","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/opre.13.3.388","volume":"13","author":"P. L. Hammer","year":"1965","unstructured":"Hammer, P. L.: Some network flow problems solved with pseudoboolean programming. Oper. Res.13, 388\u2013399 (1965).","journal-title":"Oper. Res."},{"key":"BF02238228_CR6","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. Ann. Discrete Math.5, 53\u201370 (1979).","journal-title":"Ann. Discrete Math."},{"key":"BF02238228_CR7","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1002\/1520-6750(199008)37:4<527::AID-NAV3220370407>3.0.CO;2-P","volume":"37","author":"B. Kalantari","year":"1990","unstructured":"Kalantari, B., Bagchi, A.: An algorithm for quadratic zero-one programs. Naval Res. Log.37, 527\u2013538 (1990).","journal-title":"Naval Res. Log."},{"key":"BF02238228_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01459079","volume":"40","author":"F. K\u00f6rner","year":"1982","unstructured":"K\u00f6rner, F., Richter, C.: Zur effektiven L\u00f6sung von booleschen, quadratischen Optimierungs-problemen. Numer. Math.40, 99\u2013109 (1982).","journal-title":"Numer. Math."},{"key":"BF02238228_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. W. Padberg","year":"1973","unstructured":"Padberg, M. W.: On the facial structure of set packing polyhedra. Math. Programm.5, 199\u2013215 (1973).","journal-title":"Math. Programm."},{"key":"BF02238228_CR10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M. Padberg","year":"1989","unstructured":"Padberg, M.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Programm.45, 139\u2013172 (1989).","journal-title":"Math. Programm."},{"key":"BF02238228_CR11","first-page":"147","volume":"25","author":"G. Palubeckis","year":"1985","unstructured":"Palubeckis, G.: Subgraph polytopes. Litovsk. Matem. Sbornik25, 147\u2013162 (1985) (in Russian).","journal-title":"Litovsk. Matem. Sbornik"},{"key":"BF02238228_CR12","first-page":"89","volume":"1","author":"G. Palubeckis","year":"1990","unstructured":"Palubeckis, G.: Quadratic 0\u20131 optimization. Informatica1, 89\u2013106 (1990).","journal-title":"Informatica"},{"key":"BF02238228_CR13","first-page":"225","volume":"3","author":"G. Palubeckis","year":"1992","unstructured":"Palubeckis, G.: Heuristics with a worst-case bound for unconstrained quadratic 0\u20131 programming. Informatica3, 225\u2013240 (1992).","journal-title":"Informatica"},{"key":"BF02238228_CR14","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/103147.103156","volume":"17","author":"P. M. Pardalos","year":"1991","unstructured":"Pardalos, P. M.: Construction of test problems in quadratic bivalent programming. ACM Trans. Math. Software17, 74\u201387 (1991).","journal-title":"ACM Trans. Math. Software"},{"key":"BF02238228_CR15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(92)90043-3","volume":"11","author":"P. M. Pardalos","year":"1992","unstructured":"Pardalos, P. M., Jha, S.: Complexity of uniqueness and local search in quadratic 0\u20131 programming. Oper. Res. Lett.11, 119\u2013123 (1992).","journal-title":"Oper. Res. Lett."},{"key":"BF02238228_CR16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P. M. Pardalos","year":"1990","unstructured":"Pardalos, P. M., Rodgers, G. P.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing45, 131\u2013144 (1990).","journal-title":"Computing"},{"key":"BF02238228_CR17","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)."},{"key":"BF02238228_CR18","unstructured":"\u017dilevi\u010dius, V., Rubliauskas, D., Tomkevi\u010dius, A., Palubeckis, G., Ra\u010di\u016bnas, R., Smolinskas, J.: PLACE: an effective tool for PCB component placement. In: Design Automation Conference APK'92 Proceedings, Kaunas, 66\u201372 (1992)."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238228.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02238228\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:02:27Z","timestamp":1557939747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02238228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF02238228"],"URL":"https:\/\/doi.org\/10.1007\/bf02238228","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}