scientific article
From MaRDI portal
Publication:3914777
zbMath0463.90084MaRDI QIDQ3914777
Erneste Q. Vieira Martins, Joao Carlos Namorado Climaco
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
multiobjective programmingshortest path problemnondominated pathsPareto optimal pathsmultiobjective network problemnecessary and sufficient optimality criteria
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Sensitivity, stability, parametric optimization (90C31)
Related Items
Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms, A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem, Dimensionality reduction in multiobjective shortest path search, On the bicriterion - minimal cost/minimal label - spanning tree problem, Optimal paths in bi-attribute networks with fractional cost functions, Shortest path problems with partial information: Models and algorithms for detecting dominance, A biobjective Dijkstra algorithm, On algorithms for the tricriteria shortest path problem with two bottleneck objective functions, Finding non-dominated bicriteria shortest pairs of disjoint simple paths, An algorithm for ranking paths that may contain cycles, The tricriterion shortest path problem with at least two bottleneck objective functions, An algorithm for ranking paths in acyclic networks, On a multicriteria shortest path problem, On a special class of bicriterion path problems
