Small approximate Pareto sets for biobjective shortest paths and other problems

DOI10.1137/080724514zbMATH Open1198.90346OpenAlexW2039219233MaRDI QIDQ3586183FDOQ3586183

Authors: Ilias Diakonikolas, Mihalis Yannakakis 

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

Recommendations

• Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
• Approximate Pareto sets of minimal size for multi-objective optimization problems
• One-exact approximate Pareto sets
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Approximation with a fixed number of solutions of some biobjective maximization problems

zbMATH Keywords

multiobjective optimizationapproximate Pareto setbiobjective shortest path

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited In (40)

• Approximation with a fixed number of solutions of some multiobjective maximization problems
• Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
• Approximate Pareto sets of minimal size for multi-objective optimization problems
• Finding representations for an unconstrained bi-objective combinatorial optimization problem
• The power of the weighted sum scalarization for approximating multiobjective optimization problems
• Framing algorithms for approximate multicriteria shortest paths
• Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
• New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• Computational social choice for coordination in agent networks
• Efficient optimization of many objectives by approximation-guided evolution
• Minimum effort approximation of the Pareto space of convex bi-criteria problems
• One-exact approximate Pareto sets
• Approximating multiobjective optimization problems: how exact can you be?
• Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory
• Analysis of FPTASes for the multi-objective shortest path problem
• Decision-making based on approximate and smoothed Pareto curves
• Stochastic convergence of random search methods to fixed size Pareto front approximations
• Algorithms and Computation
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
• Near linear time \((1 + \epsilon)\)-approximation for restricted shortest paths in undirected graphs
• Lower bound sets for biobjective shortest path problems
• Advancing local search approximations for multiobjective combinatorial optimization problems
• Title not available (Why is that?)
• Costs and rewards in priced timed automata
• Costs and rewards in priced timed automata
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
• On the cardinality of the Pareto set in bicriteria shortest path problems
• Approximation with a fixed number of solutions of some biobjective maximization problems
• Title not available (Why is that?)
• Obtaining approximately optimal and diverse solutions via dispersion
• A general approximation method for bicriteria minimization problems
• Computational complexity of finding Pareto efficient outcomes for biobjective lot-sizing models
• Covers and approximations in multiobjective optimization
• Reference points and approximation algorithms in multicriteria discrete optimization
• Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
• Approximating biobjective minimization problems using general ordering cones
• Efficiently computing succinct trade-off curves
• How good is the Chord algorithm?

This page was built for publication: Small approximate Pareto sets for biobjective shortest paths and other problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586183)