{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T18:28:58Z","timestamp":1783103338783,"version":"3.54.6"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1007\/bf01587084","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:09:28Z","timestamp":1114679368000},"page":"127-137","source":"Crossref","is-referenced-by-count":161,"title":["Experiments in quadratic 0\u20131 programming"],"prefix":"10.1007","volume":"44","author":[{"given":"F.","family":"Barahona","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"Reinelt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591796","volume":"30","author":"E. Balas","year":"1984","unstructured":"E. Balas and J.B. Mazzola (1984), \u201cNonlinear 0\u20131 programming: I. Linearization techniques and II. Dominance relations and algorithms,\u201dMathematical Programming 30 (1984) 1\u201345.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(86)90065-X","volume":"13","author":"F. Barahona","year":"1986","unstructured":"F. Barahona (1986), \u201cA solvable case of quadratic 0\u20131 programming,\u201dDiscrete Applied Mathematics 13 (1986) 23\u201326.","journal-title":"Discrete Applied Mathematics"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0010-4655(88)90002-1","volume":"49","author":"F. Barahona","year":"1988","unstructured":"F. Barahona and A. Casari (1988), \u201cOn the magnetization of the ground states in two-dimensional Ising spin glasses,\u201dComputer Physics Communications 49 (1988) 417\u2013421.","journal-title":"Computer Physics Communications"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F. Barahona","year":"1988","unstructured":"F. Barahona, M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt (1988), \u201cAn application of combinatorial optimization to statistical physics and circuit layout design,\u201dOperations Research 36 (1988) 493\u2013513.","journal-title":"Operations Research"},{"issue":"1","key":"CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"F. Barahona and A.R. Mahjoub (1986), \u201cOn the cut polytope,\u201dMathematical Programming 36(1) (1986) 157\u2013173.","journal-title":"Mathematical Programming"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(84)90111-2","volume":"7","author":"M.W. Carter","year":"1984","unstructured":"M.W. Carter (1984), \u201cThe indefinite zero-one quadratic problem,\u201dDiscrete Applied Mathematics 7 (1984) 23\u201344.","journal-title":"Discrete Applied Mathematics"},{"key":"CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson (1979),Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt (1984), \u201cA cutting plane algorithm for the linear ordering problem,\u201dOperations Research 32 (1984) 1195\u20131220.","journal-title":"Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/opre.13.3.388","volume":"13","author":"P.L. Hammer","year":"1965","unstructured":"P.L. Hammer (1965), \u201cSome network flow problems solved with pseudo-Boolean programming,\u201dOperations Research 13 (1965) 388\u2013399.","journal-title":"Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02612354","volume":"28","author":"P.L. Hammer","year":"1984","unstructured":"P.L. Hammer, P. Hansen and P. Simeone (1984), \u201cRoof duality, complementation and persistence in quadratic 0\u20131 optimization,\u201dMathematical Programming 28 (1984) 121\u2013155.","journal-title":"Mathematical Programming"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M.W. Padberg","year":"1986","unstructured":"M.W. Padberg and G. Rinaldi (1986), \u201cOptimization of a 532-city symmetric travelling salesman problem by branch and cut,\u201dOperations Research Letters 6 (1987) 1\u20137.","journal-title":"Operations Research Letters"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230050405","volume":"5","author":"J.C. Picard","year":"1974","unstructured":"J.C. Picard and H.D. Ratliff (1974), \u201cMinimum cuts and related problems,\u201dNetworks 5 (1974) 357\u2013370.","journal-title":"Networks"},{"key":"CR13","volume-title":"\u201cQuadratic 0\u20131 programming using the roof dual with computational results,\u201d RUTCOR Research Report #8-85","author":"A.C. Williams","year":"1985","unstructured":"A.C. Williams (1985), \u201cQuadratic 0\u20131 programming using the roof dual with computational results,\u201d RUTCOR Research Report #8-85, The State University of New Jersey (New Brunswick, NJ, 1985)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01587084.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01587084\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01587084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:31:37Z","timestamp":1556897497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01587084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["BF01587084"],"URL":"https:\/\/doi.org\/10.1007\/bf01587084","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}