Approximating the Pareto Front of Multi-criteria Optimization Problems

DOI10.1007/978-3-642-12002-2_6zbMath1284.90074OpenAlexW1490423772MaRDI QIDQ3557068

Julien Legriel, Oded Maler, Scott Cotton, Colas Le Guernic

Publication date: 27 April 2010

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12002-2_6

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (13)

Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games ⋮ On upper approximations of Pareto fronts ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ Stability verification and timing contract synthesis for linear impulsive systems using reachability analysis ⋮ Simple and efficient bi-objective search algorithms via fast dominance checks ⋮ Characterization, verification and computation of robust controlled invariants for monotone dynamical systems ⋮ Unnamed Item ⋮ Two-sided Pareto front approximations ⋮ Greening of maritime transportation: a multi-objective optimization approach ⋮ Tour recommendation for groups ⋮ Covers and approximations in multiobjective optimization ⋮ Server cloud scheduling ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories

This page was built for publication: Approximating the Pareto Front of Multi-criteria Optimization Problems