{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T06:48:25Z","timestamp":1748846905345,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,9,12]],"date-time":"2017-09-12T00:00:00Z","timestamp":1505174400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10898-017-0569-y","type":"journal-article","created":{"date-parts":[[2017,9,12]],"date-time":"2017-09-12T11:42:30Z","timestamp":1505216550000},"page":"483-500","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["lsmear: a variable selection strategy for interval branch and bound solvers"],"prefix":"10.1007","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5882-6217","authenticated-orcid":false,"given":"Ignacio","family":"Araya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Neveu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,12]]},"reference":[{"key":"569_CR1","doi-asserted-by":"crossref","unstructured":"Araya, I., Reyes, V., Oreallana, C.: More smear-based variable selection heuristics for NCSPs. In: International Conference on Tools with Artificial Intelligence (ICTAI 2013). IEEE, pp. 1004\u20131011 (2013)","DOI":"10.1109\/ICTAI.2013.151"},{"issue":"3","key":"569_CR2","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1137\/S0036142995281528","volume":"34","author":"T Csendes","year":"1997","unstructured":"Csendes, T., Ratz, D.: Subdivision direction selection in interval methods for global optimization. SIAM J. Numer. Anal. 34(3), 922\u2013938 (1997)","journal-title":"SIAM J. Numer. Anal."},{"key":"569_CR3","doi-asserted-by":"crossref","unstructured":"Granvilliers, L.: Adaptive bisection of numerical CSPs. In: Principles and Practice of Constraint Programming, pp. 290\u2013298. Springer, New York (2012)","DOI":"10.1007\/978-3-642-33558-7_23"},{"issue":"2","key":"569_CR4","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1145\/78928.78931","volume":"16","author":"RB Kearfott","year":"1990","unstructured":"Kearfott, R.B., Novoa III, M.: Algorithm 681: INTBIS, a portable interval Newton\/bisection package. ACM Trans. Math. Softw. (TOMS) 16(2), 152\u2013157 (1990)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1","key":"569_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/B:JOGO.0000049095.55259.61","volume":"30","author":"J-L Lagouanelle","year":"2004","unstructured":"Lagouanelle, J.-L., Soubry, G.: Optimal multisections in interval branch-and-bound methods of global optimization. J. Glob. Optim. 30(1), 23\u201338 (2004)","journal-title":"J. Glob. Optim."},{"key":"569_CR6","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, pp. 99\u2013104 (2011)","DOI":"10.1609\/aaai.v25i1.7817"},{"key":"569_CR7","first-page":"635","volume":"2007","author":"G Trombettoni","year":"2007","unstructured":"Trombettoni, G., Chabert, G.: Constructive interval disjunction. Princ. Pract. Constr. Program. 2007, 635\u2013650 (2007)","journal-title":"Princ. Pract. Constr. Program."},{"key":"569_CR8","unstructured":"Moore, R.: Interval analysis, vol. 60. Prentice-Hall Englewood Cliffs, New Jersey (1966)"},{"key":"569_CR9","unstructured":"Ratz, D.: Automatische ergebnisverikation bei globalen optimierungsproblemen. Ph.D. dissertation, Universit\u00e4t Karlsruhe (1992)"},{"key":"569_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9780203026922","volume-title":"Global Optimization Using Interval Analysis: Revised and Expanded","author":"E Hansen","year":"2003","unstructured":"Hansen, E., Walster, G.W.: Global Optimization Using Interval Analysis: Revised and Expanded, vol. 264. CRC Press, Boca Raton (2003)"},{"issue":"3","key":"569_CR11","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(3), 563\u2013591 (2004)","journal-title":"Math. Program."},{"issue":"4\u20135","key":"569_CR12","doi-asserted-by":"crossref","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."},{"issue":"3","key":"569_CR13","doi-asserted-by":"crossref","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":"569_CR14","doi-asserted-by":"publisher","unstructured":"Araya, I., Trombettoni, G., Neveu, B., Chabert, G.: Upper bounding in inner regions for global optimization under inequality constraints. J. Optim. Glob. (2014). doi: 10.1007\/s10898-014-0145-7","DOI":"10.1007\/s10898-014-0145-7"},{"issue":"2","key":"569_CR15","doi-asserted-by":"crossref","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. Glob. Optim. 64(2), 289\u2013304 (2016)","journal-title":"J. Glob. Optim."},{"key":"569_CR16","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revising hull and box consistency. In: International Conference on Logic Programming, Citeseer (1999)"},{"key":"569_CR17","doi-asserted-by":"crossref","unstructured":"Araya, I., Trombettoni, G., Neveu, B., et\u00a0al.: Exploiting monotonicity in interval constraint propagation. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7541"},{"key":"569_CR18","unstructured":"Lhomme, O.: Consistency techniques for numeric CSPs. In: IJCAI. Citeseer, pp. 232\u2013238 (1993)"},{"key":"569_CR19","doi-asserted-by":"crossref","unstructured":"Neveu, B., Trombettoni, G., et\u00a0al.: Adaptive constructive interval disjunction. In: International Conference on Tools with Artificial Intelligence (ICTAI), pp. 900\u2013906 (2013)","DOI":"10.1109\/ICTAI.2013.138"},{"issue":"2","key":"569_CR20","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/j.cam.2005.08.037","volume":"199","author":"Y Lebbah","year":"2007","unstructured":"Lebbah, Y., Michel, C., Rueher, M.: An efficient and safe framework for solving optimization problems. J. Comput. Appl. Math. 199(2), 372\u2013377 (2007)","journal-title":"J. Comput. Appl. Math."},{"issue":"7","key":"569_CR21","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1002\/aic.11777","volume":"55","author":"A Baharev","year":"2009","unstructured":"Baharev, A., Achterberg, T., R\u00e9v, E.: Computation of an extractive distillation column with affine arithmetic. AIChE J. 55(7), 1695\u20131704 (2009)","journal-title":"AIChE J."},{"key":"569_CR22","doi-asserted-by":"crossref","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, New York (2012)","DOI":"10.1007\/978-3-642-29828-8_1"},{"key":"569_CR23","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: Principles and Practice of Constraint Programming (CP), pp. 598\u2013602. Springer, New York (2008)","DOI":"10.1007\/978-3-540-85958-1_49"},{"key":"569_CR24","unstructured":"Wunderling, R.: Soplex: The sequential object-oriented simplex class library. http:\/\/www.zib.de\/Optimization\/Software\/Soplex\/soplex.php (1997)"},{"key":"569_CR25","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1016\/j.artint.2009.03.002","volume":"173","author":"G Chabert","year":"2009","unstructured":"Chabert, G., Jaulin, L.: Contractor programming. Artif. Intell. 173, 1079\u20131100 (2009)","journal-title":"Artif. Intell."},{"issue":"2","key":"569_CR26","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"569_CR27","doi-asserted-by":"crossref","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: Algorithms for continuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2), 503\u2013526 (2014)","DOI":"10.1007\/s10898-014-0166-2"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0569-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0569-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0569-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T18:16:49Z","timestamp":1692987409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0569-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,12]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["569"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0569-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2017,9,12]]}}}