Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
From MaRDI portal
Publication:3586183
DOI10.1137/080724514zbMath1198.90346OpenAlexW2039219233MaRDI QIDQ3586183
Mihalis Yannakakis, Ilias Diakonikolas
Publication date: 6 September 2010
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080724514
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (21)
Advancing local search approximations for multiobjective combinatorial optimization problems ⋮ Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games ⋮ Computational social choice for coordination in agent networks ⋮ Efficient optimization of many objectives by approximation-guided evolution ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ A general approximation method for bicriteria minimization problems ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Obtaining approximately optimal and diverse solutions via dispersion ⋮ Approximating biobjective minimization problems using general ordering cones ⋮ Unnamed Item ⋮ Finding representations for an unconstrained bi-objective combinatorial optimization problem ⋮ Covers and approximations in multiobjective optimization ⋮ Discrete representation of the non-dominated set for multi-objective optimization problems using kernels ⋮ Reference points and approximation algorithms in multicriteria discrete optimization ⋮ Stochastic convergence of random search methods to fixed size Pareto front approximations ⋮ Approximate Pareto sets of minimal size for multi-objective optimization problems ⋮ One-exact approximate Pareto sets ⋮ How Good is the Chord Algorithm? ⋮ Costs and rewards in priced timed automata ⋮ The power of the weighted sum scalarization for approximating multiobjective optimization problems ⋮ Unnamed Item
This page was built for publication: Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
