{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:58:02Z","timestamp":1760245082414},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,6,23]],"date-time":"2007-06-23T00:00:00Z","timestamp":1182556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s10898-007-9167-8","type":"journal-article","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T19:41:27Z","timestamp":1182541287000},"page":"75-102","source":"Crossref","is-referenced-by-count":3,"title":["Box-constrained quadratic programs with fixed charge variables"],"prefix":"10.1007","volume":"41","author":[{"given":"Tin-Chi","family":"Lin","sequence":"first","affiliation":[]},{"given":"Dieter","family":"Vandenbussche","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,6,23]]},"reference":[{"issue":"2, Ser. B","key":"9167_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01581103","volume":"81","author":"K. Aardal","year":"1998","unstructured":"Aardal K. (1998). Capacitated facility location: separation algorithms and computational experience. Math. Program. 81(2, Ser. B): 149\u2013175","journal-title":"Math. Program."},{"issue":"3","key":"9167_CR2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-6377(01)00100-6","volume":"29","author":"A. Atamt\u00fcrk","year":"2001","unstructured":"Atamt\u00fcrk A. (2001). Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. 29(3): 107\u2013114","journal-title":"Oper. Res. Lett."},{"key":"9167_CR3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1137\/0128029","volume":"28","author":"E. Balas","year":"1975","unstructured":"Balas E. (1975). Nonconvex quadratic programming via generalized polars. SIAM J. Appl. Math. 28: 335\u2013349","journal-title":"SIAM J. Appl. Math."},{"key":"9167_CR4","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1287\/mnsc.30.10.1255","volume":"30","author":"I. Barany","year":"1984","unstructured":"Barany I., Van Roy T.J. and Wolsey L.A. (1984). Strong formulations for multi-item capacitated lotsizing. Manage. Sci. 30: 1255\u20131261","journal-title":"Manage. Sci."},{"key":"9167_CR5","first-page":"1","volume":"4","author":"I.M. Bomze","year":"1994","unstructured":"Bomze I.M. and Danninger G. (1994). A finite algorithm for solving general quadratic problems. GOP 4: 1\u201316","journal-title":"GOP"},{"key":"9167_CR6","unstructured":"Christof, T., L\u00f6bel, A.: PORTA: a polyhedron representation transformation algorithm.http:\/\/www.zib.de\/Optimization\/Software\/Porta\/ (1997)"},{"key":"9167_CR7","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder H., Johnson E.L. and Padberg M.W. (1983). Solving large scale zero-one integer programming problems. Oper. Res. 31: 803\u2013834","journal-title":"Oper. Res."},{"key":"9167_CR8","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1287\/moor.27.1.210.335","volume":"27","author":"I.R. Farias de Jr","year":"2002","unstructured":"Johnson E.L. and Nemhauser G.L. (2002). Facets of the complementarity knapsack polytope. Math. Oper. Res. 27: 210\u2013226","journal-title":"Math. Oper. Res."},{"key":"9167_CR9","doi-asserted-by":"crossref","unstructured":"Giannessi, F., Tomasin, E.: Nonconvex quadratic programs, linear complementarity problems, and integer linear programs. In: Proceeding of the 5th Conference on Optimization Techniques (Rome, 1973), Part I. Lecture Notes in Computer Science, vol. 3, pp. 437\u2013449. Springer, Berlin (1973)","DOI":"10.1007\/3-540-06583-0_43"},{"key":"9167_CR10","doi-asserted-by":"crossref","unstructured":"Grossmann, I.E., Kravanja, Z.: Mixed-integer nonlinear programming: a survey of algorithms and applications. In: Biegler, L.T., Coleman, T.F., Conn, A.R., Santosa, F.N. (eds.) Large-scale optimization with applications, Part II (Minneapolis, MN, 1995), vol. 93 of IMA Vol. Math. Appl., pp. 73\u2013100. Springer, New York (1997)","DOI":"10.1007\/978-1-4612-1960-6_5"},{"issue":"3, Ser. A","key":"9167_CR11","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Z. Gu","year":"1999","unstructured":"Gu Z., Nemhauser G.L. and Savelsbergh M.W.P. (1999). Lifted flow cover inequalities for mixed 0-1 integer programs. Math. Program. 85(3, Ser. A): 439\u2013467","journal-title":"Math. Program."},{"key":"9167_CR12","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1002\/1520-6750(199304)40:3<373::AID-NAV3220400307>3.0.CO;2-A","volume":"40","author":"P. Hansen","year":"1993","unstructured":"Hansen P., Jaumard B., Ruiz M. and Xiong J. (1993). Global minimization of indefinite quadratic functions subject to box constraints. Nav. Res. Logist. 40: 373\u2013392","journal-title":"Nav. Res. Logist."},{"issue":"2\u20133","key":"9167_CR13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10589-005-3062-3","volume":"33","author":"H. Huang","year":"2006","unstructured":"Huang H., Pardalos P.M. and Prokopyev O.A. (2006). Lower bound improvement and forcing rule for quadratic binary programming. Comput. Optim. Appl. 33(2\u20133): 187\u2013208","journal-title":"Comput. Optim. Appl."},{"key":"9167_CR14","unstructured":"ILOG, Inc. ILOG CPLEX 9.0, User Manual (2003)"},{"key":"9167_CR15","unstructured":"Lin, T.C., Vandenbussche, D.: Box-constrained quadratic programs with fixed charge variables. Technical report, Department of Mechanical and Industrial Engineering, University of Illinois Urbana-Champaign. https:\/\/netfiles.uiuc.edu\/dieterv\/www\/publications.html. (2006)"},{"key":"9167_CR16","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. Motzkin","year":"1965","unstructured":"Motzkin T.S. and Straus E.G. (1965). Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math. 17: 533\u2013540","journal-title":"Can. J. Math."},{"key":"9167_CR17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"Nemhauser G.L., Savelsbergh M.W.P. and Sigismondi G.S. (1994). MINTO, a mixed INTeger optimizer. Oper. Res. Lett. 15: 47\u201358","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"9167_CR18","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1023\/A:1026596100403","volume":"18","author":"I. Nowak","year":"2000","unstructured":"Nowak I. (2000). Dual bounds and optimality cuts for all-quadratic programs with convex constraints. J. Glob. Optim. 18(4): 337\u2013356","journal-title":"J. Glob. Optim."},{"key":"9167_CR19","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M. Padberg","year":"1989","unstructured":"Padberg M. (1989). The Boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45: 139\u2013172","journal-title":"Math. Program."},{"key":"9167_CR20","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M.W. Padberg","year":"1985","unstructured":"Padberg M.W., Van Roy T.J. and Wolsey L.A. (1985). Valid linear inequalities for fixed charge problems. Oper. Res. 33: 842\u2013861","journal-title":"Oper. Res."},{"issue":"2","key":"9167_CR21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos P.M. and Rodgers G.P. (1990a). Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45(2): 131\u2013144","journal-title":"Computing"},{"issue":"1\u20134","key":"9167_CR22","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02023057","volume":"22","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos P.M. and Rodgers G.P. (1990b). Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture. Ann. Oper. Res. 22(1\u20134): 271\u2013292","journal-title":"Ann. Oper. Res."},{"issue":"2, Ser. B","key":"9167_CR23","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-004-0529-4","volume":"101","author":"P.M. Pardalos","year":"2004","unstructured":"Pardalos P.M., Chaovalitwongse W., Iasemidis L.D., Sackellares C.J., Shiau D., Carney P.R., Prokopyev O.A. and Yatsenko V.A. (2004). Seizure warning algorithm based on optimization and nonlinear dynamics. Math. Program. 101(2, Ser. B): 365\u2013385","journal-title":"Math. Program."},{"issue":"4","key":"9167_CR24","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1002\/1520-6750(199008)37:4<499::AID-NAV3220370405>3.0.CO;2-9","volume":"37","author":"A.T. Phillips","year":"1990","unstructured":"Phillips A.T. and Rosen J.B. (1990). Guaranteed \u03b5-approximate solution for indefinite quadratic global minimization. Nav. Res. Logist. 37(4): 499\u2013514","journal-title":"Nav. Res. Logist."},{"key":"9167_CR25","volume-title":"Optimizing Reservoir Resources","author":"C. Revelle","year":"1999","unstructured":"Revelle C. (1999). Optimizing Reservoir Resources. Wiley, New York"},{"key":"9167_CR26","first-page":"95","volume":"6","author":"I.G. Rosenberg","year":"1972","unstructured":"Rosenberg I.G. (1972). 0-1 optimization and nonlinear programming. Rev. Fr. Autom. Inf. Rech. Op\u00e9rationnelle 6: 95\u201397","journal-title":"Rev. Fr. Autom. Inf. Rech. Op\u00e9rationnelle"},{"key":"9167_CR27","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"N.V. Sahinidis","year":"1996","unstructured":"Sahinidis N.V. (1996). BARON: a general purpose global optimization software package. J. Glob. Optim. 8: 201\u2013205","journal-title":"J. Glob. Optim."},{"key":"9167_CR28","unstructured":"Sahinidis, N.V., Tawarmalani, M.: BARON 7.5: global optimization of mixed-integer nonlinear programs, User\u2019s Manual. Available at http:\/\/www.gams.com\/dd\/docs\/solvers\/baron.pdf. (2006)"},{"key":"9167_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H.D. Sherali","year":"1995","unstructured":"Sherali H.D. and Tuncbilek C.H. (1995). A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Glob. Optim. 7: 1\u201331","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9167_CR30","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-004-0549-0","volume":"102","author":"D. Vandenbussche","year":"2005","unstructured":"Vandenbussche D. and Nemhauser G. (2005a). A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3): 531\u2013557","journal-title":"Math. Program."},{"issue":"3","key":"9167_CR31","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10107-004-0550-7","volume":"102","author":"D. Vandenbussche","year":"2005","unstructured":"Vandenbussche D. and Nemhauser G. (2005b). A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3): 559\u2013575","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9167-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-007-9167-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9167-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:12:08Z","timestamp":1559304728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-007-9167-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,23]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["9167"],"URL":"https:\/\/doi.org\/10.1007\/s10898-007-9167-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,23]]}}}