A model of anytime algorithm performance for bi-objective optimization

DOI10.1007/s10898-020-00909-9zbMath1465.90092OpenAlexW3024170895MaRDI QIDQ2022237

Arnaud Liefooghe, Alexandre D. Jesus, Luís Paquete

Publication date: 28 April 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-02898963/file/main.pdf

zbMATH Keywords

multi-objective optimizationcombinatorial optimizationanytime algorithms\(\varepsilon\)-constraintanytime behavior

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items

Preface to the special issue dedicated to the 14th international workshop on global optimization held in Leiden, the Netherlands, September 18--21, 2018

Uses Software

• GLPK
• SPOT
• irace

Cites Work

• Anytime Pareto local search
• Representation of the non-dominated set in biobjective discrete optimization
• Combining VNS with constraint programming for solving anytime optimization problems
• Evolutionary multi-criterion optimization. 4th international conference, EMO 2007, Matsushima, Japan, March 5--8, 2007. Proceedings
• Deliberation scheduling for problem solving in time-constrained environments
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• Finding representations for an unconstrained bi-objective combinatorial optimization problem
• Automatically improving the anytime behaviour of optimisation algorithms
• On Klee's measure problem for grounded boxes
• Experimental Methods for the Analysis of Optimization Algorithms
• Discrete Dynamic Programming and Capital Allocation
• An analysis of approximations for maximizing submodular set functions—I
• Multicriteria Optimization
• Optimal schedules for monitoring anytime algorithms
• Monitoring and control of anytime algorithms: A dynamic programming approach