{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T10:45:17Z","timestamp":1779360317330,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T00:00:00Z","timestamp":1595980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T00:00:00Z","timestamp":1595980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10107-020-01547-5","type":"journal-article","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T11:03:52Z","timestamp":1596020632000},"page":"523-537","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers"],"prefix":"10.1007","volume":"188","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6320-8154","authenticated-orcid":false,"given":"Timo","family":"Berthold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Csizmadia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,29]]},"reference":[{"issue":"1","key":"1547_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"1547_CR2","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E Balas","year":"1975","unstructured":"Balas, E.: Facets of the knapsack polytope. Math. Program. 8(1), 146\u2013164 (1975)","journal-title":"Math. Program."},{"key":"1547_CR3","doi-asserted-by":"crossref","unstructured":"Belotti, P., Berthold, T., Neves, K.: Algorithms for discrete nonlinear optimization in FICO Xpress. In: 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM), pp. 1\u20135. IEEE (2016)","DOI":"10.1109\/SAM.2016.7569658"},{"issue":"6","key":"1547_CR4","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.orl.2013.08.007","volume":"41","author":"T Berthold","year":"2013","unstructured":"Berthold, T.: Measuring the impact of primal heuristics. Oper. Res. Lett. 41(6), 611\u2013614 (2013)","journal-title":"Oper. Res. Lett."},{"key":"1547_CR5","volume-title":"Heuristic Algorithms in Global MINLP Solvers","author":"T Berthold","year":"2014","unstructured":"Berthold, T.: Heuristic Algorithms in Global MINLP Solvers. Verlag Dr, Hut Munich (2014)"},{"issue":"3","key":"1547_CR6","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1080\/10556788.2017.1333612","volume":"33","author":"T Berthold","year":"2018","unstructured":"Berthold, T., Farmer, J., Heinz, S., Perregaard, M.: Parallelization of the FICO xpress-optimizer. Optim. Methods Softw. 33(3), 518\u2013529 (2018)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1547_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13675-018-0109-7","volume":"7","author":"T Berthold","year":"2019","unstructured":"Berthold, T., Lodi, A., Salvagnin, D.: Ten years of feasibility pump, and counting. EURO J. Comput. Optim. 7(1), 1\u201314 (2019)","journal-title":"EURO J. Comput. Optim."},{"issue":"1","key":"1547_CR8","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib\u2014a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"1547_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02592196","volume":"74","author":"A Caprara","year":"1996","unstructured":"Caprara, A., Fischetti, M.: $$\\{$$0, 1\/2$$\\}$$-Chv\u00e1tal\u2013Gomory cuts. Math. Program. 74(3), 221\u2013235 (1996)","journal-title":"Math. Program."},{"key":"1547_CR10","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/BF01609036","volume":"15","author":"HP Crowder","year":"1978","unstructured":"Crowder, H.P., Dembo, R.S., Mulvey, J.M.: Reporting computational experiments in mathematical programming. Math. Program. 15, 316\u2013329 (1978)","journal-title":"Math. Program."},{"issue":"3","key":"1547_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36(3), 307\u2013339 (1986)","journal-title":"Math. Program."},{"key":"1547_CR12","unstructured":"Gleixner, A., Hendel, G., Gamrath, G., Achterberg, T., Bastubbe, M., Berthold, T., Christophel, P., Jarck, K., Koch, T., Linderoth, J., et al.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Tech. rep, Technical report, Optimization Online (2019)"},{"key":"1547_CR13","doi-asserted-by":"crossref","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs and an algorithm for the mixed integer problem. In: 50 Years of Integer Programming 1958\u20132008, pp. 77\u2013103. Springer (2010)","DOI":"10.1007\/978-3-540-68279-0_4"},{"issue":"1","key":"1547_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1137\/0101002","volume":"1","author":"A Hoffman","year":"1953","unstructured":"Hoffman, A., Mannos, M., Sokolowsky, D., Wiegmann, N.: Computational experience in solving linear programs. J. Soc. Ind. Appl. Math. 1(1), 17\u201333 (1953)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"2","key":"1547_CR15","first-page":"210","volume":"42","author":"J Hooker","year":"1993","unstructured":"Hooker, J.: Needed: an empirical science of algorithms. Oper. Res. 42(2), 210\u2013212 (1993)","journal-title":"Oper. Res."},{"key":"1547_CR16","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01588801","volume":"49","author":"RHF Jackson","year":"1991","unstructured":"Jackson, R.H.F., Boggs, P.T., Nash, S.G., Powell, S.: Guidelines for reporting results of computational experiments. Report of the ad hoc committee. Math. Program. 49, 413\u2013425 (1991)","journal-title":"Math. Program."},{"issue":"1","key":"1547_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.8.1.1","volume":"8","author":"CC McGeoch","year":"1996","unstructured":"McGeoch, C.C.: Toward an experimental method for algorithm simulation. INFORMS J. Comput. 8(1), 1\u201315 (1996)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"1547_CR18","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"MW Padberg","year":"1985","unstructured":"Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid linear inequalities for fixed charge problems. Oper. Res. 33(4), 842\u2013861 (1985)","journal-title":"Oper. Res."},{"issue":"10","key":"1547_CR19","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1287\/mnsc.28.10.1106","volume":"28","author":"F Palacios-Gomez","year":"1982","unstructured":"Palacios-Gomez, F., Lasdon, L., Engquist, M.: Nonlinear optimization by successive linear programming. Manag. Sci. 28(10), 1106\u20131120 (1982)","journal-title":"Manag. Sci."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01547-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01547-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01547-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T23:51:48Z","timestamp":1627516308000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01547-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,29]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["1547"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01547-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,29]]},"assertion":[{"value":"30 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}