M. Boddy and T. L. Dean, Deliberation scheduling for problem solving in time-constrained environments, Artificial Intelligence, vol.67, issue.2, p.90054, 1994.

B. Braden, The surveyor's area formula, The College Mathematics Journal, vol.17, issue.4, pp.326-337, 1986.

T. Dean and M. Boddy, An analysis of time-dependent planning, Proceedings of the Seventh AAAI National Conference on Artificial Intelligence, AAAI'88, pp.49-54, 1988.

J. Dubois-lacoste, M. López-ibáñez, and T. Stützle, Anytime Pareto local search, European Journal of Operational Research, vol.243, issue.2, pp.369-385, 2015.

M. Ehrgott, Multicriteria Optimization, 2005.

M. T. Emmerich and A. H. Deutz, Test problems based on Lamé superspheres, Evolutionary Multi-Criterion Optimization, pp.922-936, 2007.

L. Finkelstein and S. Markovitch, Optimal schedules for monitoring anytime algorithms, Artificial Intelligence, vol.126, issue.1-2, pp.63-108, 2001.

M. Gagliolo and C. Legrand, Algorithm survival analysis, Experimental Methods for the Analysis of Optimization Algorithms, pp.161-184, 2010.

E. A. Hansen and S. Zilberstein, Monitoring anytime algorithms, SIGART Bulletin, vol.7, issue.2, pp.28-33, 1996.

E. A. Hansen and S. Zilberstein, Monitoring and control of anytime algorithms: A dynamic programming approach, Artificial Intelligence, vol.126, issue.1-2, pp.68-68, 2001.

E. J. Horvitz, Reasoning about beliefs and actions under computational resource constraints, Proceedings of the Third Conference on Uncertainty in Artificial Intelligence, UAI-87, pp.429-447, 1987.

A. D. Jesus, , 2019.

A. D. Jesus, L. Paquete, and J. R. Figueira, Finding representations for an unconstrained bi-objective combinatorial optimization problem, Optimization Letters, vol.12, issue.2, pp.321-334, 2018.

J. Knowles and D. Corne, On metrics for comparing nondominated sets, Proceedings of the 2002 Congress on Evolutionary Computation, CEC'02, vol.1, pp.711-716, 2002.

T. Kuhn, C. M. Fonseca, L. Paquete, S. Ruzika, M. M. Duarte et al., Hypervolume subset selection in two dimensions: Formulations and algorithms, Evolutionary Computation, vol.24, issue.3, pp.411-425, 2015.

M. López-ibáñez, J. Dubois-lacoste, T. Stützle, and M. Birattari, The irace package: Iterated racing for automatic algorithm configuration, Operations Research Perspectives, vol.3, pp.43-58, 2016.

M. López-ibáñez, T. Liao, and T. Stützle, On the anytime behavior of IPOP-CMA-ES. In: Parallel Problem Solving from Nature -PPSN XII, pp.357-366, 2012.

M. López-ibáñez and T. Stützle, Automatically improving the anytime behaviour of optimisation algorithms, European Journal of Operational Research, vol.235, issue.3, pp.569-582, 2014.

S. Loudni and P. Boizumault, Combining VNS with constraint programming for solving anytime optimization problems, European Journal of Operational Research, vol.191, issue.3, pp.705-735, 2008.

A. Makhorin, GNU Linear Programming Kit -v4, vol.65, 2018.

G. L. Nemhauser and Z. Ullmann, Discrete dynamic programming and capital allocation, Management Science, vol.15, issue.9, pp.494-505, 1969.

G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, An analysis of approximations for maximizing submodular set functions, Mathematical Programming, vol.14, issue.1, pp.265-294, 1978.

M. Pilu and R. B. Fisher, Equal-distance sampling of superellipse models, Procedings of the British Machine Vision Conference, BMVC 1995, pp.257-266, 1995.

A. Radulescu, M. López-ibáñez, and T. Stützle, Automatically improving the anytime behaviour of multiobjective evolutionary algorithms, Evolutionary Multi-Criterion Optimization, pp.825-840, 2013.

S. Say?n, Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming, Mathematical Programming, vol.87, issue.3, pp.543-560, 2000.

T. Ulrich and L. Thiele, Bounding the effectiveness of hypervolume-based (µ + ?)-archiving algorithms, Learning and Intelligent Optimization, pp.235-249, 2012.

D. Vaz, L. Paquete, C. M. Fonseca, K. Klamroth, and M. Stiglmayr, Representation of the non-dominated set in biobjective discrete optimization, Computers & Operations Research, vol.63, pp.172-186, 2015.

S. Verel, A. Liefooghe, L. Jourdan, and C. Dhaenens, Analyzing the effect of objective correlation on the efficient set of mnk-landscapes, Learning and Intelligent Optimization, pp.116-130, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00550349

H. Yildiz and S. Suri, On Klee's measure problem for grounded boxes, Proceedings of the Twenty-Eigth Annual Symposium on Computational Geometry, SoCG '12, pp.111-120, 2012.

S. Zilberstein, Using anytime algorithms in intelligent systems, AI Magazine, vol.17, issue.3, pp.73-83, 1996.

E. Zitzler and L. Thiele, Multiobjective optimization using evolutionary algorithms -A comparative case study. In: Parallel Problem Solving from Nature -PPSN V, PPSN 1998, pp.292-301, 1998.

E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca, and V. Grunert-da-fonseca, Performance assessment of multiobjective optimizers: An analysis and review, IEEE Transactions on Evolutionary Computation, vol.7, issue.2, pp.117-132, 2003.