Deliberation scheduling for problem solving in time-constrained environments, Artificial Intelligence, vol.67, issue.2, p.90054, 1994. ,
The surveyor's area formula, The College Mathematics Journal, vol.17, issue.4, pp.326-337, 1986. ,
An analysis of time-dependent planning, Proceedings of the Seventh AAAI National Conference on Artificial Intelligence, AAAI'88, pp.49-54, 1988. ,
Anytime Pareto local search, European Journal of Operational Research, vol.243, issue.2, pp.369-385, 2015. ,
Multicriteria Optimization, 2005. ,
Test problems based on Lamé superspheres, Evolutionary Multi-Criterion Optimization, pp.922-936, 2007. ,
Optimal schedules for monitoring anytime algorithms, Artificial Intelligence, vol.126, issue.1-2, pp.63-108, 2001. ,
Algorithm survival analysis, Experimental Methods for the Analysis of Optimization Algorithms, pp.161-184, 2010. ,
Monitoring anytime algorithms, SIGART Bulletin, vol.7, issue.2, pp.28-33, 1996. ,
Monitoring and control of anytime algorithms: A dynamic programming approach, Artificial Intelligence, vol.126, issue.1-2, pp.68-68, 2001. ,
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. ,
, , 2019.
Finding representations for an unconstrained bi-objective combinatorial optimization problem, Optimization Letters, vol.12, issue.2, pp.321-334, 2018. ,
On metrics for comparing nondominated sets, Proceedings of the 2002 Congress on Evolutionary Computation, CEC'02, vol.1, pp.711-716, 2002. ,
Hypervolume subset selection in two dimensions: Formulations and algorithms, Evolutionary Computation, vol.24, issue.3, pp.411-425, 2015. ,
The irace package: Iterated racing for automatic algorithm configuration, Operations Research Perspectives, vol.3, pp.43-58, 2016. ,
On the anytime behavior of IPOP-CMA-ES. In: Parallel Problem Solving from Nature -PPSN XII, pp.357-366, 2012. ,
Automatically improving the anytime behaviour of optimisation algorithms, European Journal of Operational Research, vol.235, issue.3, pp.569-582, 2014. ,
Combining VNS with constraint programming for solving anytime optimization problems, European Journal of Operational Research, vol.191, issue.3, pp.705-735, 2008. ,
GNU Linear Programming Kit -v4, vol.65, 2018. ,
Discrete dynamic programming and capital allocation, Management Science, vol.15, issue.9, pp.494-505, 1969. ,
An analysis of approximations for maximizing submodular set functions, Mathematical Programming, vol.14, issue.1, pp.265-294, 1978. ,
Equal-distance sampling of superellipse models, Procedings of the British Machine Vision Conference, BMVC 1995, pp.257-266, 1995. ,
Automatically improving the anytime behaviour of multiobjective evolutionary algorithms, Evolutionary Multi-Criterion Optimization, pp.825-840, 2013. ,
Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming, Mathematical Programming, vol.87, issue.3, pp.543-560, 2000. ,
Bounding the effectiveness of hypervolume-based (µ + ?)-archiving algorithms, Learning and Intelligent Optimization, pp.235-249, 2012. ,
Representation of the non-dominated set in biobjective discrete optimization, Computers & Operations Research, vol.63, pp.172-186, 2015. ,
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
On Klee's measure problem for grounded boxes, Proceedings of the Twenty-Eigth Annual Symposium on Computational Geometry, SoCG '12, pp.111-120, 2012. ,
Using anytime algorithms in intelligent systems, AI Magazine, vol.17, issue.3, pp.73-83, 1996. ,
Multiobjective optimization using evolutionary algorithms -A comparative case study. In: Parallel Problem Solving from Nature -PPSN V, PPSN 1998, pp.292-301, 1998. ,
Performance assessment of multiobjective optimizers: An analysis and review, IEEE Transactions on Evolutionary Computation, vol.7, issue.2, pp.117-132, 2003. ,