Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
From MaRDI portal
Publication:3762099
Recommendations
- Small approximate Pareto sets for biobjective shortest paths and other problems
- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
- New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
- A multi-objective shortest path problem
Cited in
(only showing first 100 items - show all)- Competitive algorithms for the bicriteria \(k\)-server problem
- An interactive procedure using domination cones for bicriterion shortest path problems
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
- Redundancy elimination in the estimation of multiple paths
- Approximation with a fixed number of solutions of some multiobjective maximization problems
- New approaches to multi-objective optimization
- The subdivision-constrained routing requests problem
- Routing with nonlinear multiattribute cost functions
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- Nodal aggregation of resource constraints in a shortest path problem
- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
- Approximating the Restricted 1-Center in Graphs
- Efficiently Generating k-Best Solutions to Procurement Auctions
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Bicriterion shortest paths in stochastic time-dependent networks
- A simple efficient approximation scheme for the restricted shortest path problem
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
- Approximation algorithms for multi-parameter graph optimization problems
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- Simple paths with exact and forbidden lengths
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
- Approximating the weight of shallow Steiner trees
- Framing algorithms for approximate multicriteria shortest paths
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Efficient solutions for the bicriteria network flow problem
- Modifying edges of a network to obtain short subgraphs
- New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
- Maximum probabilistic all-or-nothing paths
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- Stack-up algorithms for palletizing at delivery industry
- Approximate tradeoffs on weighted labeled matroids
- Bulk-robust combinatorial optimization
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- An improved FPTAS for Restricted Shortest Path.
- Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
- Dynamic programming approaches to solve the shortest path problem with forbidden paths
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- An empirical investigation of some bicriterion shortest path algorithms
- Bicriteria network flow problems: Integer case
- Bounded-hops power assignment in ad hoc wireless networks
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- On finding dissimilar Pareto-optimal paths
- The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- Approximation schemes for a class of subset selection problems
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Decision-making based on approximate and smoothed Pareto curves
- Compact location problems with budget and communication constraints
- The determination of the path with minimum-cost norm value
- The median tour and maximal covering tour problems: Formulations and heuristics
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- Approximation of a set of Pareto-optimal solutions
- Facility location with dynamic distance functions
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- Multiobjective routing of hazardous materials in stochastic networks
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Multiobjective routing problems
- A combination of flow shop scheduling and the shortest path problem
- The quickest path problem with interval lead times
- Near linear time \((1 + \epsilon)\)-approximation for restricted shortest paths in undirected graphs
- Fundamentals of Computation Theory
- A survey of recent developments in multiobjective optimization
- Label correcting methods to solve multicriteria shortest path problems
- A parametric approach to solving bicriterion shortest path problems
- An interactive approach to identify the best compromise solution for two objective shortest path problems
- Maximum probability shortest path problem
- On budget-constrained flow improvement.
- Simple and efficient bi-objective search algorithms via fast dominance checks
- Minmax combinatorial optimization
- Small approximate Pareto sets for biobjective shortest paths and other problems
- Improving the solution complexity of the scheduling problem with deadlines: a general technique
- A discussion of scalarization techniques for multiple objective integer programming
- On the cardinality of the Pareto set in bicriteria shortest path problems
- Optimal paths in bi-attribute networks with fractional cost functions
- Norm-based approximation in multicriteria programming.
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path
- Finding representative systems for discrete bicriterion optimization problems
- The interactive analysis of the multicriteria shortest path problem by the reference point method.
- Finding cheapest deadline paths
- Covers and approximations in multiobjective optimization
- Fuzzy shortest path problems incorporating interactivity among paths.
- A two-criterion lexicographic algorithm for finding all shortest paths in networks
- Reference points and approximation algorithms in multicriteria discrete optimization
- scientific article; zbMATH DE number 7121919 (Why is no real title available?)
- Approximation algorithms for constructing some required structures in digraphs
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- Approximating the restricted 1-center in graphs
- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
- On local optima in multiobjective combinatorial optimization problems
- Multicriteria adaptive paths in stochastic, time-varying networks
- Optimal pricing and composition of multiple bundles: a two-step approach
- Efficiently computing succinct trade-off curves
- Bi-criteria path problem with minimum length and maximum survival probability
- Modifying networks to obtain low cost trees
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- Multiple criteria dynamic programming and multiple knapsack problem
- Discrete dynamic programming with outcomes in random variable structures
This page was built for publication: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3762099)
