{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:43Z","timestamp":1740122443478,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T00:00:00Z","timestamp":1716595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T00:00:00Z","timestamp":1716595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s10898-024-01403-2","type":"journal-article","created":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T08:01:36Z","timestamp":1716624096000},"page":"355-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Node selection through upper bounding local search methods in branch & bound solvers for NCOPs"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3358-3906","authenticated-orcid":false,"given":"Victor","family":"Reyes","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5882-6217","authenticated-orcid":false,"given":"Ignacio","family":"Araya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"issue":"4\u20135","key":"1403_CR1","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1080\/10556780902753452","volume":"24","author":"Y Lebbah","year":"2009","unstructured":"Lebbah, Y.: Icos: a branch and bound based solver for rigorous global optimization. Optim. Methods Softw. 24(4\u20135), 709\u2013726 (2009)","journal-title":"Optim. Methods Softw."},{"key":"1403_CR2","unstructured":"Neveu, B., Trombettoni, G., Araya, I.: Node selection heuristics using the upper bound in interval branch and bound, In: Proceedings of GOW, pp.\u00a01\u20134, (2014)"},{"key":"1403_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10898-015-0375-3","volume":"64","author":"B Neveu","year":"2016","unstructured":"Neveu, B., Trombettoni, G., Araya, I.: Node selection strategies in interval branch and bound algorithms. J. Global Optim. 64, 289\u2013304 (2016)","journal-title":"J. Global Optim."},{"key":"1403_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10107-005-0607-2","volume":"106","author":"MC Mark\u00f3t","year":"2006","unstructured":"Mark\u00f3t, M.C., Fern\u00e1ndez, J., Casado, L.G., Csendes, T.: New interval methods for constrained global optimization. Math. Program. 106, 287\u2013318 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"1403_CR5","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10898-017-0569-y","volume":"71","author":"I Araya","year":"2017","unstructured":"Araya, I., Neveu, B.: lsmear: a variable selection strategy for interval branch and bound solvers. J. Glob. Optim. 71(3), 483\u2013500 (2017)","journal-title":"J. Glob. Optim."},{"key":"1403_CR6","first-page":"635","volume-title":"Principles and Practice of Constraint Programming-CP","author":"G Trombettoni","year":"2007","unstructured":"Trombettoni, G., Chabert, G.: Constructive interval disjunction. In: Principles and Practice of Constraint Programming-CP, pp. 635\u2013650. Springer, Berlin (2007)"},{"key":"1403_CR7","first-page":"1","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"I Araya","year":"2012","unstructured":"Araya, I., Trombettoni, G., Neveu, B.: A contractor based on convex interval taylor. In: Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, pp. 1\u201316. Springer, Berlin (2012)"},{"issue":"3","key":"1403_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10288-014-0269-0","volume":"13","author":"J Ninin","year":"2015","unstructured":"Ninin, J., Messine, F., Hansen, P.: A reliable affine relaxation method for global optimization. 4OR 13(3), 247\u2013277 (2015)","journal-title":"4OR"},{"key":"1403_CR9","doi-asserted-by":"crossref","unstructured":"Goldsztejn, A., Lebbah, Y., Michel, C., Rueher, M.: Revisiting the upper bounding process in a safe branch and bound algorithm, In: International Conference on Principles and Practice of Constraint Programming, pp.\u00a0598\u2013602, Springer, (2008)","DOI":"10.1007\/978-3-540-85958-1_49"},{"issue":"2","key":"1403_CR10","first-page":"503","volume":"59","author":"R Misener","year":"2013","unstructured":"Misener, R., Floudas, C.A.: Antigone: algorithms for continuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2), 503\u2013526 (2013)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1403_CR11","doi-asserted-by":"publisher","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. Glob. Optim. 8(2), 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1403_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1287\/ijoc.6.2.207","volume":"6","author":"AS Drud","year":"1994","unstructured":"Drud, A.S.: CONOPT-a large-scale GRG code. ORSA J. Comput. 6(2), 207\u2013216 (1994)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"1403_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"1403_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10898-014-0145-7","volume":"60","author":"I Araya","year":"2014","unstructured":"Araya, I., Trombettoni, G., Neveu, B., Chabert, G.: Upper bounding in inner regions for global optimization under inequality constraints. J. Global Optim. 60(2), 145\u2013164 (2014)","journal-title":"J. Global Optim."},{"key":"1403_CR15","doi-asserted-by":"crossref","unstructured":"Araya, I., Reyes, V. Abstaylor: finding inner regions for nonlinear constraint systems with linearizations and absolute values, In: AIP Conference Proceedings, vol.\u00a02070, p.\u00a0020027. AIP Publishing LLC, (2019)","DOI":"10.1063\/1.5089994"},{"issue":"2","key":"1403_CR16","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10898-020-00878-z","volume":"79","author":"V Reyes","year":"2021","unstructured":"Reyes, V., Araya, I.: Abstaylor: upper bounding with inner regions in nonlinear continuous global optimization problems. J. Glob. Optim. 79(2), 413\u2013429 (2021)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1403_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","volume":"149","author":"R Bixby","year":"2007","unstructured":"Bixby, R., Rothberg, E.: Progress in computational mixed integer programming-a look back from the other side of the tipping point. Ann. Oper. Res. 149(1), 37 (2007)","journal-title":"Ann. Oper. Res."},{"key":"1403_CR18","first-page":"1","volume-title":"Mixed Integer Nonlinear Programming","author":"P Bonami","year":"2011","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. In: De, T. (ed.) Mixed Integer Nonlinear Programming, pp. 1\u201339. Springer, Berlin (2011)"},{"issue":"3","key":"1403_CR19","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10(3), 383\u2013421 (2018)","journal-title":"Math. Program. Comput."},{"key":"1403_CR20","doi-asserted-by":"crossref","unstructured":"Lasdon, L.S., Waren, A.D., Jain, A., Ratner, M.: Design and testing of a generalized reduced gradient code for nonlinear programming, Technical. Report, Stanford University CA Systems Optimization Laboratory (1976)","DOI":"10.21236\/ADA009402"},{"key":"1403_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods, vol. 54. SIAM, New Delhi (1997)"},{"issue":"4","key":"1403_CR22","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1137\/060649513","volume":"19","author":"J Nocedal","year":"2009","unstructured":"Nocedal, J., W\u00e4chter, A., Waltz, R.A.: Adaptive barrier update strategies for nonlinear interior methods. SIAM J. Optim. 19(4), 1674\u20131693 (2009)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1403_CR23","first-page":"159","volume":"3","author":"V Klee","year":"1972","unstructured":"Klee, V., Minty, G.J.: How good is the simplex algorithm. Inequalities 3(3), 159\u2013175 (1972)","journal-title":"Inequalities"},{"key":"1403_CR24","doi-asserted-by":"crossref","unstructured":"Trombettoni, G., Araya,I., Neveu,B., Chabert, G.: Inner regions and interval linearizations for global optimization. In: AAAI Conference on Artificial Intelligence (2011)","DOI":"10.1609\/aaai.v25i1.7817"},{"key":"1403_CR25","unstructured":"Benhamou, F., Goualard, F., Granvilliers,L., Puget, J.-F.: Revising hull and box consistency, In: International Conference on Logic Programming, Citeseer, (1999)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01403-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01403-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01403-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T05:47:48Z","timestamp":1739598468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01403-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,25]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["1403"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01403-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2024,5,25]]},"assertion":[{"value":"28 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}