Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
From MaRDI portal
Publication:3762099
DOI10.1287/opre.35.1.70zbMath0623.90084MaRDI QIDQ3762099
Publication date: 1987
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.35.1.70
fully polynomial approximation schemes; multi-objective, shortest-path problems; set of Pareto optimal paths
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90C31: Sensitivity, stability, parametric optimization
Related Items
The determination of the path with minimum-cost norm value, Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms, A simple efficient approximation scheme for the restricted shortest path problem, Label correcting methods to solve multicriteria shortest path problems, Routing with nonlinear multiattribute cost functions, Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., On finding dissimilar Pareto-optimal paths, A parametric approach to solving bicriterion shortest path problems, Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications, Discrete dynamic programming with outcomes in random variable structures, An interactive approach to identify the best compromise solution for two objective shortest path problems, Minmax combinatorial optimization, Efficient solutions for the bicriteria network flow problem, Bicriteria network flow problems: Integer case, Modifying edges of a network to obtain short subgraphs, Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function, Approximating the weight of shallow Steiner trees, An interactive procedure using domination cones for bicriterion shortest path problems, The median tour and maximal covering tour problems: Formulations and heuristics, The interactive analysis of the multicriteria shortest path problem by the reference point method., Norm-based approximation in multicriteria programming., A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem., Fuzzy shortest path problems incorporating interactivity among paths., Stack-up algorithms for palletizing at delivery industry, Approximation algorithms for multi-parameter graph optimization problems, The quickest path problem with interval lead times, An empirical investigation of some bicriterion shortest path algorithms, An improved FPTAS for Restricted Shortest Path., Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach, Multiobjective routing problems, Multiobjective transportation network design and routing problems: Taxonomy and annotation, Multiobjective routing of hazardous materials in stochastic networks, Decision-making based on approximate and smoothed Pareto curves, Approximation schemes for a class of subset selection problems, Competitive algorithms for the bicriteria \(k\)-server problem, Finding representative systems for discrete bicriterion optimization problems, A survey of recent developments in multiobjective optimization, On local optima in multiobjective combinatorial optimization problems, Nodal aggregation of resource constraints in a shortest path problem, Multicriteria adaptive paths in stochastic, time-varying networks, Bounded-hops power assignment in ad hoc wireless networks, Efficiently computing succinct trade-off curves, Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem, On budget-constrained flow improvement.
