Small approximate Pareto sets for biobjective shortest paths and other problems
From MaRDI portal
Publication:3586183
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
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
- 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
- Approximating multiobjective optimization problems: how exact can you be?
- Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- Algorithms and Computation
- Lower bound sets for biobjective shortest path problems
- Near linear time \((1 + \epsilon)\)-approximation for restricted shortest paths in undirected graphs
- Advancing local search approximations for multiobjective combinatorial optimization problems
- scientific article; zbMATH DE number 1830716 (Why is no real title available?)
- Costs and rewards in priced timed automata
- Costs and rewards in priced timed automata
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- On the cardinality of the Pareto set in bicriteria shortest path problems
- Approximation with a fixed number of solutions of some biobjective maximization problems
- scientific article; zbMATH DE number 1848402 (Why is no real title available?)
- A general approximation method for bicriteria minimization problems
- Obtaining approximately optimal and diverse solutions via dispersion
- Covers and approximations in multiobjective optimization
- Computational complexity of finding Pareto efficient outcomes for biobjective lot-sizing models
- Reference points and approximation algorithms in multicriteria discrete optimization
- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
- Efficiently computing succinct trade-off curves
- Approximating biobjective minimization problems using general ordering cones
- 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)
