{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:36:52Z","timestamp":1761896212037},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T00:00:00Z","timestamp":1452556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10589-015-9818-5","type":"journal-article","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T05:39:29Z","timestamp":1452577169000},"page":"513-533","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Theoretical and computational results about optimality-based domain reductions"],"prefix":"10.1007","volume":"64","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Locatelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Monaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,12]]},"reference":[{"key":"9818_CR1","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1023\/A:1022600232285","volume":"94","author":"HP Benson","year":"1997","unstructured":"Benson, H.P., Boger, G.M.: Multiplicative programming problems: analysis and efficient point search heuristic. J. Optim. Theory Appl. 94, 487\u2013510 (1997)","journal-title":"J. Optim. Theory Appl."},{"key":"9818_CR2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10107-008-0263-4","volume":"125","author":"A Caprara","year":"2010","unstructured":"Caprara, A., Locatelli, M.: Global optimization problems and domain reduction strategies. Math. Program. 125, 123\u2013137 (2010)","journal-title":"Math. Program."},{"key":"9818_CR3","unstructured":"Couenne, v. branch\/CouenneClassifier, r1046. https:\/\/projects.coin-or.org\/Couenne"},{"key":"9818_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF01100238","volume":"3","author":"ASE Hamed","year":"1993","unstructured":"Hamed, A.S.E., McCormick, G.P.: Calculation of bounds on variables satisfying nonlinear inequality constraints. J. Global Optim. 3, 25\u201347 (1993)","journal-title":"J. Global Optim."},{"key":"9818_CR5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF01582889","volume":"52","author":"P Hansen","year":"1991","unstructured":"Hansen, P., Jaumard, B., Lu, S.-H.: An analytical approach to global optimization. Math. Program. 52, 227\u2013254 (1991)","journal-title":"Math. Program."},{"key":"9818_CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01580893","volume":"56","author":"H Konno","year":"1992","unstructured":"Konno, H., Kuno, T.: Linear multiplicative programming. Math. Program. 56, 51\u201364 (1992)","journal-title":"Math. Program."},{"key":"9818_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00120666","volume":"1","author":"H Konno","year":"1991","unstructured":"Konno, H., Yajima, Y., Matsui, T.: Parametric simplex algorithms for solving a special class of non-convex minimization problems. J. Global Optim. 1, 65\u201381 (1991)","journal-title":"J. Global Optim."},{"key":"9818_CR8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00253808","volume":"1","author":"H Konno","year":"1992","unstructured":"Konno, H., Kuno, T., Yajima, Y.: Parametric simplex algorithms for a class of NP complete problems whose average number of steps is polynomial. Comput. Optim. Appl. 1, 227\u2013239 (1992)","journal-title":"Comput. Optim. Appl."},{"key":"9818_CR9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1011250901810","volume":"20","author":"T Kuno","year":"2001","unstructured":"Kuno, T.: A finite branch-and-bound algorithm for linear multiplicative programming. Comput. Optim. Appl. 20, 119\u2013135 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"9818_CR10","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1023\/A:1008308913266","volume":"15","author":"XJ Liu","year":"1999","unstructured":"Liu, X.J., Umegaki, T., Yamamoto, Y.: Heuristic methods for linear multiplicative programming. J. Global Optim. 15, 433\u2013447 (1999)","journal-title":"J. Global Optim."},{"key":"9818_CR11","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0098-1354(96)00282-7","volume":"21","author":"CD Maranas","year":"1997","unstructured":"Maranas, C.D., Floudas, C.A.: Global optimization in generalized geometric programming. Comput. Chem. Eng. 21, 351\u2013370 (1997)","journal-title":"Comput. Chem. Eng."},{"key":"9818_CR12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T Matsui","year":"1996","unstructured":"Matsui, T.: NP-hardness of linear multiplicative programming and related problems. J. Global Optim. 9, 113\u2013119 (1996)","journal-title":"J. Global Optim."},{"key":"9818_CR13","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s10898-007-9267-5","volume":"41","author":"RM Oliveira","year":"2008","unstructured":"Oliveira, R.M., Ferreira, P.A.V.: A convex analysis approach for convex multiplicative programming. J. Global Optim. 41, 579\u2013592 (2008)","journal-title":"J. Global Optim."},{"key":"9818_CR14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P Pardalos","year":"1991","unstructured":"Pardalos, P., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Global Optim. 1, 15\u201322 (1991)","journal-title":"J. Global Optim."},{"key":"9818_CR15","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00171828","volume":"2","author":"AT Phillips","year":"1992","unstructured":"Phillips, A.T., Rosen, J.B., Van Vliet, M.: A parallel stochastic method for solving linearly constrained concave global minimization problems. J. Global Optim. 2, 243\u2013258 (1992)","journal-title":"J. Global Optim."},{"key":"9818_CR16","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"HS Ryoo","year":"1996","unstructured":"Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Global Optim. 8, 107\u2013139 (1996)","journal-title":"J. Global Optim."},{"key":"9818_CR17","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1023\/A:1024700901538","volume":"26","author":"HS Ryoo","year":"2003","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of multiplicative programs. J. Global Optim. 26, 387\u2013418 (2003)","journal-title":"J. Global Optim."},{"key":"9818_CR18","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Global Optim. 8, 201\u2013205 (1996)","journal-title":"J. Global Optim."},{"key":"9818_CR19","unstructured":"Tawarmalani, M., Sahinidis, N.V.: BARON on the Web. http:\/\/archimedes.scs.uiuc.edu\/cgi\/run.pl"},{"key":"9818_CR20","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"9818_CR21","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1008312714792","volume":"14","author":"JM Zamora","year":"1999","unstructured":"Zamora, J.M., Grossmann, I.E.: A Branch and Contract algorithm for problems with concave univariate, bilinear and linear fractional terms. J. Global Optim. 14, 217\u2013249 (1999)","journal-title":"J. Global Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9818-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9818-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9818-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:41Z","timestamp":1559241461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9818-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,12]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["9818"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9818-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,12]]}}}