{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T14:51:28Z","timestamp":1768402288760,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T00:00:00Z","timestamp":1589587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T00:00:00Z","timestamp":1589587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["SFRH\/BD\/132275\/2017"],"award-info":[{"award-number":["SFRH\/BD\/132275\/2017"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10898-020-00909-9","type":"journal-article","created":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T01:02:48Z","timestamp":1589590968000},"page":"329-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A model of anytime algorithm performance for bi-objective optimization"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7691-0295","authenticated-orcid":false,"given":"Alexandre D.","family":"Jesus","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7525-8901","authenticated-orcid":false,"given":"Lu\u00eds","family":"Paquete","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3283-3122","authenticated-orcid":false,"given":"Arnaud","family":"Liefooghe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,16]]},"reference":[{"issue":"2","key":"909_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0004-3702(94)90054-X","volume":"67","author":"M Boddy","year":"1994","unstructured":"Boddy, M., Dean, T.L.: Deliberation scheduling for problem solving in time-constrained environments. Artif. Intell. 67(2), 245\u2013285 (1994). https:\/\/doi.org\/10.1016\/0004-3702(94)90054-X","journal-title":"Artif. Intell."},{"issue":"4","key":"909_CR2","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1080\/07468342.1986.11972974","volume":"17","author":"B Braden","year":"1986","unstructured":"Braden, B.: The surveyor\u2019s area formula. Coll. Math. J. 17(4), 326\u2013337 (1986). https:\/\/doi.org\/10.1080\/07468342.1986.11972974","journal-title":"Coll. Math. J."},{"key":"909_CR3","unstructured":"Dean, T., Boddy, M.: An analysis of time-dependent planning. In: Proceedings of the Seventh AAAI National Conference on Artificial Intelligence, AAAI\u201988, pp. 49\u201354. AAAI Press (1988)"},{"issue":"2","key":"909_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ejor.2014.10.062","volume":"243","author":"J Dubois-Lacoste","year":"2015","unstructured":"Dubois-Lacoste, J., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Anytime Pareto local search. Eur. J. Oper. Res. 243(2), 369\u2013385 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.10.062","journal-title":"Eur. J. Oper. Res."},{"key":"909_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27659-9","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/3-540-27659-9","edition":"2"},{"key":"909_CR6","doi-asserted-by":"publisher","unstructured":"Emmerich, M.T.M., Deutz, A.H.: Test problems based on Lam\u00e9 superspheres. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) Evolutionary Multi-Criterion Optimization, EMO 2007, pp. 922\u2013936. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-70928-2_68","DOI":"10.1007\/978-3-540-70928-2_68"},{"issue":"1\u20132","key":"909_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0004-3702(00)00072-2","volume":"126","author":"L Finkelstein","year":"2001","unstructured":"Finkelstein, L., Markovitch, S.: Optimal schedules for monitoring anytime algorithms. Artif. Intell. 126(1\u20132), 63\u2013108 (2001). https:\/\/doi.org\/10.1016\/S0004-3702(00)00072-2","journal-title":"Artif. Intell."},{"key":"909_CR8","doi-asserted-by":"publisher","unstructured":"Gagliolo, M., Legrand, C.: Algorithm survival analysis. In: Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss, M. (eds.) Experimental Methods for the Analysis of Optimization Algorithms, pp. 161\u2013184. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-02538-9_7","DOI":"10.1007\/978-3-642-02538-9_7"},{"issue":"2","key":"909_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/242587.242593","volume":"7","author":"EA Hansen","year":"1996","unstructured":"Hansen, E.A., Zilberstein, S.: Monitoring anytime algorithms. SIGART Bull. 7(2), 28\u201333 (1996). https:\/\/doi.org\/10.1145\/242587.242593","journal-title":"SIGART Bull."},{"issue":"1\u20132","key":"909_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0004-3702(00)00068-0","volume":"126","author":"EA Hansen","year":"2001","unstructured":"Hansen, E.A., Zilberstein, S.: Monitoring and control of anytime algorithms: a dynamic programming approach. Artif. Intell. 126(1\u20132), 139\u2013157 (2001). https:\/\/doi.org\/10.1016\/S0004-3702(00)00068-0","journal-title":"Artif. Intell."},{"key":"909_CR11","unstructured":"Horvitz, E.J.: Reasoning about beliefs and actions under computational resource constraints. In: Proceedings of the Third Conference on Uncertainty in Artificial Intelligence, UAI-87, pp. 429\u2013447. AUAI Press, Corvallis, Oregon (1987)"},{"key":"909_CR12","doi-asserted-by":"publisher","unstructured":"Jesus, A.D.: moco_abm v0.2.0 (2019). https:\/\/doi.org\/10.5281\/zenodo.3548869","DOI":"10.5281\/zenodo.3548869"},{"issue":"2","key":"909_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s11590-017-1129-6","volume":"12","author":"AD Jesus","year":"2018","unstructured":"Jesus, A.D., Paquete, L., Figueira, J.R.: Finding representations for an unconstrained bi-objective combinatorial optimization problem. Optim. Lett. 12(2), 321\u2013334 (2018). https:\/\/doi.org\/10.1007\/s11590-017-1129-6","journal-title":"Optim. Lett."},{"key":"909_CR14","doi-asserted-by":"publisher","unstructured":"Knowles, J., Corne, D.: On metrics for comparing nondominated sets. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC\u201902, vol.\u00a01, pp. 711\u2013716. IEEE (2002). https:\/\/doi.org\/10.1109\/CEC.2002.1007013","DOI":"10.1109\/CEC.2002.1007013"},{"issue":"3","key":"909_CR15","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1162\/EVCO_a_00157","volume":"24","author":"T Kuhn","year":"2015","unstructured":"Kuhn, T., Fonseca, C.M., Paquete, L., Ruzika, S., Duarte, M.M., Figueira, J.R.: Hypervolume subset selection in two dimensions: Formulations and algorithms. Evol. Comput. 24(3), 411\u2013425 (2015). https:\/\/doi.org\/10.1162\/EVCO_a_00157","journal-title":"Evol. Comput."},{"key":"909_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T., Birattari, M.: The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016). https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Oper. Res. Perspect."},{"key":"909_CR17","doi-asserted-by":"publisher","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Liao, T., St\u00fctzle, T.: On the anytime behavior of IPOP-CMA-ES. In: Coello Coello, C.A., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) Parallel Problem Solving from Nature\u2014PPSN XII, PPSN 2012, pp. 357\u2013366. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-32937-1_36","DOI":"10.1007\/978-3-642-32937-1_36"},{"issue":"3","key":"909_CR18","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.ejor.2013.10.043","volume":"235","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2014","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Automatically improving the anytime behaviour of optimisation algorithms. Eur. J. Oper. Res. 235(3), 569\u2013582 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2013.10.043","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"909_CR19","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/j.ejor.2006.12.062","volume":"191","author":"S Loudni","year":"2008","unstructured":"Loudni, S., Boizumault, P.: Combining VNS with constraint programming for solving anytime optimization problems. Eur. J. Oper. Res. 191(3), 705\u2013735 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2006.12.062","journal-title":"Eur. J. Oper. Res."},{"key":"909_CR20","unstructured":"Makhorin, A.: GNU Linear Programming Kit\u2014v4.65 (2018). https:\/\/www.gnu.org\/software\/glpk\/"},{"issue":"9","key":"909_CR21","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1287\/mnsc.15.9.494","volume":"15","author":"GL Nemhauser","year":"1969","unstructured":"Nemhauser, G.L., Ullmann, Z.: Discrete dynamic programming and capital allocation. Manag. Sci. 15(9), 494\u2013505 (1969). https:\/\/doi.org\/10.1287\/mnsc.15.9.494","journal-title":"Manag. Sci."},{"issue":"1","key":"909_CR22","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Math. Program. 14(1), 265\u2013294 (1978). https:\/\/doi.org\/10.1007\/BF01588971","journal-title":"Math. Program."},{"key":"909_CR23","doi-asserted-by":"publisher","unstructured":"Pilu, M., Fisher, R.B.: Equal-distance sampling of superellipse models. In: Procedings of the British Machine Vision Conference, BMVC 1995, pp. 257\u2013266. BMVA Press (1995). https:\/\/doi.org\/10.5244\/C.9.26","DOI":"10.5244\/C.9.26"},{"key":"909_CR24","doi-asserted-by":"publisher","unstructured":"Radulescu, A., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Automatically improving the anytime behaviour of multiobjective evolutionary algorithms. In: Purshouse, R.C., Fleming, P.J., Fonseca, C.M., Greco, S., Shaw, J. (eds.) Evolutionary Multi-Criterion Optimization, EMO 2013, pp. 825\u2013840. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-642-37140-0_61","DOI":"10.1007\/978-3-642-37140-0_61"},{"issue":"3","key":"909_CR25","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s101070050011","volume":"87","author":"S Say\u0131n","year":"2000","unstructured":"Say\u0131n, S.: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math. Program. 87(3), 543\u2013560 (2000). https:\/\/doi.org\/10.1007\/s101070050011","journal-title":"Math. Program."},{"key":"909_CR26","doi-asserted-by":"publisher","unstructured":"Ulrich, T., Thiele, L.: Bounding the effectiveness of hypervolume-based ($$\\mu +\\lambda $$)-archiving algorithms. In: Hamadi, Y., Schoenauer, M. (eds.) Learning and Intelligent Optimization, LION 2012, pp. 235\u2013249. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-34413-8_17","DOI":"10.1007\/978-3-642-34413-8_17"},{"key":"909_CR27","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2015.05.003","volume":"63","author":"D Vaz","year":"2015","unstructured":"Vaz, D., Paquete, L., Fonseca, C.M., Klamroth, K., Stiglmayr, M.: Representation of the non-dominated set in biobjective discrete optimization. Comput. Oper. Res. 63, 172\u2013186 (2015). https:\/\/doi.org\/10.1016\/j.cor.2015.05.003","journal-title":"Comput. Oper. Res."},{"key":"909_CR28","doi-asserted-by":"publisher","unstructured":"Verel, S., Liefooghe, A., Jourdan, L., Dhaenens, C.: Analyzing the effect of objective correlation on the efficient set of mnk-landscapes. In: Coello Coello, C.A. (ed.) Learning and Intelligent Optimization, LION 2011, pp. 116\u2013130. Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_9","DOI":"10.1007\/978-3-642-25566-3_9"},{"key":"909_CR29","doi-asserted-by":"publisher","unstructured":"Yildiz, H., Suri, S.: On Klee\u2019s measure problem for grounded boxes. In: Proceedings of the Twenty-Eigth Annual Symposium on Computational Geometry, SoCG \u201912, pp. 111\u2013120. Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2261250.2261267","DOI":"10.1145\/2261250.2261267"},{"issue":"3","key":"909_CR30","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1609\/aimag.v17i3.1232","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein, S.: Using anytime algorithms in intelligent systems. AI Mag. 17(3), 73\u201383 (1996). https:\/\/doi.org\/10.1609\/aimag.v17i3.1232","journal-title":"AI Mag."},{"key":"909_CR31","doi-asserted-by":"publisher","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms\u2014a comparative case study. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature\u2014PPSN V, PPSN 1998, pp. 292\u2013301. Springer, Berlin (1998). https:\/\/doi.org\/10.1007\/BFb0056872","DOI":"10.1007\/BFb0056872"},{"issue":"2","key":"909_CR32","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003). https:\/\/doi.org\/10.1109\/TEVC.2003.810758","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00909-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00909-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00909-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T23:04:56Z","timestamp":1621119896000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00909-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,16]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["909"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00909-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,16]]},"assertion":[{"value":"30 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}