{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:19:30Z","timestamp":1774369170248,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T00:00:00Z","timestamp":1705881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T00:00:00Z","timestamp":1705881600000},"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":[[2024,6]]},"DOI":"10.1007\/s10898-023-01362-0","type":"journal-article","created":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T01:02:11Z","timestamp":1705885331000},"page":"457-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Interval constraint programming for globally solving catalog-based categorical optimization"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1131-7631","authenticated-orcid":false,"given":"Charlie","family":"Vanaret","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,22]]},"reference":[{"issue":"1","key":"1362_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00158-017-1890-2","volume":"58","author":"H Gao","year":"2018","unstructured":"Gao, H., Breitkopf, P., Coelho, R.F., Xiao, M.: Categorical structural optimization using discrete manifold learning approach and custom-built evolutionary operators. Struct. Multidiscip. Optim. 58(1), 215\u2013228 (2018)","journal-title":"Struct. Multidiscip. Optim."},{"issue":"5","key":"1362_CR2","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1080\/0305215X.2018.1495716","volume":"51","author":"Z Ned\u011blkov\u00e1","year":"2019","unstructured":"Ned\u011blkov\u00e1, Z., Cromvik, C., Lindroth, P., Patriksson, M., Str\u00f6mberg, A.-B.: A splitting algorithm for simulation-based optimization problems with categorical variables. Eng. Optim. 51(5), 815\u2013831 (2019)","journal-title":"Eng. Optim."},{"key":"1362_CR3","doi-asserted-by":"crossref","unstructured":"Barjhoux, P.-J., Diouane, Y., Grihon, S., Bettebghor, D., Morlier, J.: Mixed variable structural optimization: toward an efficient hybrid algorithm. In: World Congress of Structural and Multidisciplinary Optimisation, pp. 1880\u20131896 (2017). Springer","DOI":"10.1007\/978-3-319-67988-4_140"},{"key":"1362_CR4","volume-title":"Pure Categorical Optimization: A Global Descent Approach","author":"P Lindroth","year":"2011","unstructured":"Lindroth, P., Patriksson, M.: Pure Categorical Optimization: A Global Descent Approach. Department of Mathematical Sciences, Division of Mathematics, Chalmers (2011)"},{"issue":"2","key":"1362_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s11081-010-9109-z","volume":"11","author":"K Abhishek","year":"2010","unstructured":"Abhishek, K., Leyffer, S., Linderoth, J.T.: Modeling without categorical variables: a mixed-integer nonlinear program for the optimization of thermal insulation systems. Optim. Eng. 11(2), 185\u2013212 (2010)","journal-title":"Optim. Eng."},{"key":"1362_CR6","unstructured":"Agurok, I.: Multi-extremum optimization in lens design: navigation through merit function valleys maze. arXiv preprint arXiv:1907.08676 (2019)"},{"key":"1362_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-2299-9","volume-title":"Advanced Geometrical Optics","author":"PD Lin","year":"2017","unstructured":"Lin, P.D.: Advanced Geometrical Optics. Springer, Berlin (2017)"},{"key":"1362_CR8","unstructured":"Lecoutre, C., Likitvivatanavong, C., Yap, R.H.: A path-optimal GAC algorithm for table constraints. In: ECAI 2012, pp. 510\u2013 515. IOS Press (2012)"},{"issue":"2","key":"1362_CR9","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BF02032577","volume":"5","author":"DR Brown","year":"1993","unstructured":"Brown, D.R., Hwang, K.-Y.: Solving fixed configuration problems with genetic search. Res. Eng. Design 5(2), 80\u201387 (1993)","journal-title":"Res. Eng. Design"},{"issue":"1","key":"1362_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01616555","volume":"8","author":"SE Carlson","year":"1996","unstructured":"Carlson, S.E.: Genetic algorithm attributes for component selection. Res. Eng. Design 8(1), 33\u201351 (1996)","journal-title":"Res. Eng. Design"},{"issue":"2","key":"1362_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01616688","volume":"10","author":"S Carlson-Skalak","year":"1998","unstructured":"Carlson-Skalak, S., White, M.D., Teng, Y.: Using an evolutionary algorithm for catalog design. Res. Eng. Design 10(2), 63\u201383 (1998)","journal-title":"Res. Eng. Design"},{"issue":"2","key":"1362_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10107-005-0585-4","volume":"103","author":"A Neumaier","year":"2005","unstructured":"Neumaier, A., Shcherbina, O., Huyer, W., Vink\u00f3, T.: A comparison of complete global optimization solvers. Math. Program. 103(2), 335\u2013356 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"1362_CR13","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. Global Optim. 8(2), 201\u2013205 (1996)","journal-title":"J. Global Optim."},{"key":"1362_CR14","volume-title":"Interval Analysis","author":"RE Moore","year":"1966","unstructured":"Moore, R.E.: Interval Analysis, vol. 4. Englewood Cliffs, New Jersey (1966)"},{"key":"1362_CR15","doi-asserted-by":"crossref","unstructured":"Trombettoni, G., Araya, I., Neveu, B., Chabert, G.: Inner regions and interval linearizations for global optimization. In: AAAI ( 2011)","DOI":"10.1609\/aaai.v25i1.7817"},{"key":"1362_CR16","unstructured":"Ninin, J., Hansen, P., Messine, F.: A Reliable Affine Relaxation Method for Global Optimization. Groupe d\u2019\u00e9tudes et de recherche en analyse des d\u00e9cisions ( 2010)"},{"key":"1362_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2495-0","volume-title":"Rigorous Global Search: Continuous Problems","author":"RB Kearfott","year":"1996","unstructured":"Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Springer, Berlin (1996)"},{"key":"1362_CR18","doi-asserted-by":"crossref","unstructured":"Vanaret, C.: Hybridization of interval methods and evolutionary algorithms for solving difficult optimization problems. Ph.D. thesis, INP Toulouse (2015)","DOI":"10.1007\/978-3-319-23219-5_32"},{"key":"1362_CR19","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1017\/S0962492904000194","volume":"13","author":"A Neumaier","year":"2004","unstructured":"Neumaier, A.: Complete search in continuous global optimization and constraint satisfaction. Acta Numer. 13, 271\u2013369 (2004)","journal-title":"Acta Numer."},{"key":"1362_CR20","unstructured":"Puget, J.-F.: A C++ implementation of CLP. In: Proceedings of the Singapore Conference on Intelligent Systems (1994)"},{"key":"1362_CR21","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5073.001.0001","volume-title":"Numerica: a modeling language for global optimization","author":"P Van Hentenryck","year":"1997","unstructured":"Van Hentenryck, P., Michel, L., Deville, Y.: Numerica: a modeling language for global optimization. MIT Press, London (1997)"},{"key":"1362_CR22","unstructured":"Jussien, N., Rochart, G., Lorca, X.: Choco: an open source java constraint programming library. In: CPAIOR\u201908 Workshop on Open-Source Software for Integer and Contraint Programming (OSSICP\u201908), pp 1\u201310 (2008)"},{"issue":"11","key":"1362_CR23","doi-asserted-by":"publisher","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(11), 1079\u20131100 (2009)","journal-title":"Artif. Intell."},{"key":"1362_CR24","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revising hull and box consistency. In: International Conference on Logic Programming, pp. 230\u2013 244. MIT Press, London ( 1999)"},{"key":"1362_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, X., Liu, S.: A new interval-genetic algorithm. In: Third International Conference on Natural Computation (ICNC 2007), vol. 4, pp. 193\u2013 197. IEEE (2007)","DOI":"10.1109\/ICNC.2007.95"},{"issue":"1","key":"1362_CR26","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TSMCB.2006.883266","volume":"37","author":"JE Gallardo","year":"2007","unstructured":"Gallardo, J.E., Cotta, C., Fern\u00e1ndez, A.J.: On the hybridization of memetic algorithms with branch-and-bound techniques. IEEE Trans. Syst. Man Cybern. Part B 37(1), 77\u201383 (2007)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"issue":"6","key":"1362_CR27","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11(6), 4135\u20134151 (2011)","journal-title":"Appl. Soft Comput."},{"key":"1362_CR28","doi-asserted-by":"crossref","unstructured":"Cotta, C., Aldana, J., Nebro, A.J., Troya, J.M.: Hybridizing genetic algorithms with branch and bound techniques for the resolution of the TSP. In: Artificial Neural Nets and Genetic Algorithms, pp. 277\u2013 280. Springer (1995)","DOI":"10.1007\/978-3-7091-7535-4_73"},{"key":"1362_CR29","unstructured":"Alliot, J.-M., Durand, N., Gianazza, D., Gotteland, J.-B.: Finding and proving the optimum: cooperative stochastic and deterministic search. In: ECAI, pp. 55\u2013 60 (2012)"},{"issue":"1","key":"1362_CR30","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF02252616","volume":"23","author":"K Ichida","year":"1979","unstructured":"Ichida, K., Fujii, Y.: An interval arithmetic method for global optimization. Computing 23(1), 85\u201397 (1979)","journal-title":"Computing"},{"issue":"2","key":"1362_CR31","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1145\/78928.78931","volume":"16","author":"RB Kearfott","year":"1990","unstructured":"Kearfott, R.B., Novoa, M., III.: Algorithm 681: INTBIS, a portable interval Newton\/bisection package. ACM Trans. Math. Softw. 16(2), 152\u2013157 (1990)","journal-title":"ACM Trans. Math. Softw."},{"key":"1362_CR32","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"2013","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer, Berlin (2013)"},{"key":"1362_CR33","doi-asserted-by":"crossref","unstructured":"Araya, I., Trombettoni, G., Neveu, B.: A contractor based on convex interval Taylor. In: International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, pp. 1\u201316. Springer (2012)","DOI":"10.1007\/978-3-642-29828-8_1"},{"issue":"29\u201346","key":"1362_CR34","first-page":"209","volume":"2","author":"T Sunaga","year":"1958","unstructured":"Sunaga, T.: Theory of interval algebra and its application to numerical analysis. RAAG Memoirs 2(29\u201346), 209 (1958)","journal-title":"RAAG Memoirs"},{"issue":"2","key":"1362_CR35","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10107-003-0433-3","volume":"99","author":"A Neumaier","year":"2004","unstructured":"Neumaier, A., Shcherbina, O.: Safe bounds in linear and mixed-integer linear programming. Math. Program. 99(2), 283\u2013296 (2004)","journal-title":"Math. Program."},{"key":"1362_CR36","unstructured":"Messine, F.: M\u00e9thodes d\u2019optimisation globale bas\u00e9es sur l\u2019analyse d\u2019intervalle pour la r\u00e9solution de probl\u00e8mes avec contraintes. PhD thesis, Toulouse, INPT (1997)"},{"issue":"4","key":"1362_CR37","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1051\/ro:2004026","volume":"38","author":"F Messine","year":"2004","unstructured":"Messine, F.: Deterministic global optimization using interval constraint propagation techniques. RAIRO-Oper. Res. 38(4), 277\u2013293 (2004)","journal-title":"RAIRO-Oper. Res."},{"key":"1362_CR38","doi-asserted-by":"crossref","unstructured":"Belotti, P., Cafieri, S., Lee, J., Liberti, L.: Feasibility-based bounds tightening via fixed points. In: International Conference on Combinatorial Optimization and Applications, pp. 65\u2013 76. Springer (2010)","DOI":"10.1007\/978-3-642-17458-2_7"},{"issue":"2","key":"1362_CR39","first-page":"125","volume":"2","author":"JG Cleary","year":"1987","unstructured":"Cleary, J.G.: Logical arithmetic. Future Comput. Syst. 2(2), 125\u2013149 (1987)","journal-title":"Future Comput. Syst."},{"issue":"1","key":"1362_CR40","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. 8(1), 99\u2013118 (1977)","journal-title":"Artif. Intell."},{"key":"1362_CR41","doi-asserted-by":"publisher","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."},{"key":"1362_CR42","unstructured":"Bestuzheva, K., et al.: The SCIP Optimization Suite 8.0. ZIB-Report 21-41, Zuse Institute, Berlin (2021)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01362-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01362-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01362-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T07:12:22Z","timestamp":1715584342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01362-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,22]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["1362"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01362-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,22]]},"assertion":[{"value":"13 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 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":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"None.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of data and material"}},{"value":"A Julia prototype is available as open-source software under the MIT license at .","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}