{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T22:08:57Z","timestamp":1775686137877,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":[[1996,8]]},"DOI":"10.1007\/bf02592208","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:57:40Z","timestamp":1175183860000},"page":"121-140","source":"Crossref","is-referenced-by-count":248,"title":["Computational study of a family of mixed-integer quadratic programming problems"],"prefix":"10.1007","volume":"74","author":[{"given":"Daniel","family":"Bienstock","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02592208_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"E. Balas, Intersection cuts\u2014a new type of cutting planes for integer programming.Operations Research 19 (1971) 19\u201339.","journal-title":"Operations Research"},{"key":"BF02592208_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas, S. Ceria and G. Cornu\u00e9jols. A lift-and-project cutting plane algorithm for mixed 0\u20131 programs,Mathematical Programming 58 (1993) 295\u2013324.","journal-title":"Mathematical Programming"},{"key":"BF02592208_CR3","unstructured":"E. Balas, S. Ceria and G. Cornu\u00e9jols. Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework,Management Science (to appear)."},{"key":"BF02592208_CR4","unstructured":"W. Cook, personal communication."},{"key":"BF02592208_CR5","unstructured":"R. Bixby, personal communication."},{"key":"BF02592208_CR6","unstructured":"R. Bixby, W.J. Cook, A. Cox and E. Lee, Parallel mixed-integer programming, manuscript (1994)."},{"key":"BF02592208_CR7","unstructured":"Cplex Optimization, Inc."},{"key":"BF02592208_CR8","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1137\/0804046","volume":"4","author":"J. Eckstein","year":"1994","unstructured":"J. Eckstein, Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5,SIAM Journal on Optimization 4 (1994) 794\u2013814.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02592208_CR9","unstructured":"R. Fletcher,Practical Methods of Optimization, Vol. 2 (Wiley, 1981)."},{"key":"BF02592208_CR10","unstructured":"H. Konno and K. Suzuki, A fast algorithm for solving large scale mean-variance models by compact factorization of covariance matrices, Report IHSS 91-32, Institute of Human and Social Sciences, Tokyo Institute of Technology (1991)."},{"key":"BF02592208_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"key":"BF02592208_CR12","unstructured":"D.G. Luenberger,Linear and Nonlinear Programming (Addison Wesley, 1984)."},{"key":"BF02592208_CR13","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1287\/mnsc.30.10.1143","volume":"30","author":"A.F. Perold","year":"1984","unstructured":"A.F. Perold, Large-scale protfolio optimization,Management Science 30 (1984) 1143\u20131160.","journal-title":"Management Science"},{"key":"BF02592208_CR14","unstructured":"M. Savelsbergh, personal communication (1995)."},{"key":"BF02592208_CR15","unstructured":"L.A. Wolsey, personal communication."},{"key":"BF02592208_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01581257","volume":"58","author":"R.J. Vanderbei","year":"1993","unstructured":"R.J. Vanderbei and T.J. Carpenter, Symmetric indefinite systems for interior point methods,Mathematical Programming 58 (1993) 1\u201332.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592208.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592208\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:53Z","timestamp":1558395473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["BF02592208"],"URL":"https:\/\/doi.org\/10.1007\/bf02592208","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}