A bicriterion shortest path algorithm
From MaRDI portal
Publication:1166423
DOI10.1016/0377-2217(82)90205-3zbMath0488.90068OpenAlexW2071852134MaRDI QIDQ1166423
Joao Carlos Namorado Climaco, Ernesto Queirós Vieira Martins
Publication date: 1982
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(82)90205-3
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Sensitivity, stability, parametric optimization (90C31)
Related Items (74)
The shortest path problem with two objective functions ⋮ The minmax regret robust shortest path problem in a finite multi-scenario model ⋮ Multiobjective routing of hazardous materials in stochastic networks ⋮ A comprehensive survey on the quickest path problem ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ On the cardinality of the Pareto set in bicriteria shortest path problems ⋮ A decision-theoretic approach to robust optimization in multivalued graphs ⋮ Computing all efficient solutions of the biobjective minimum spanning tree problem ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems ⋮ On the bicriterion - minimal cost/minimal label - spanning tree problem ⋮ An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Multiobjective routing problems ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ Bicriteria path problem minimizing the cost and minimizing the number of labels ⋮ A general decomposition approach for multi-criteria decision trees ⋮ On a relaxed maximally disjoint path pair problem: a bicriteria approach ⋮ An exact method to generate all nondominated spanning trees ⋮ Obtaining approximately optimal and diverse solutions via dispersion ⋮ The Steiner bi-objective shortest path problem ⋮ An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks ⋮ On the sum-max bicriterion path problem. ⋮ The interactive analysis of the multicriteria shortest path problem by the reference point method. ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem ⋮ Solving bicriteria 0--1 knapsack problems using a labeling algorithm. ⋮ An interactive approach to identify the best compromise solution for two objective shortest path problems ⋮ An efficient time and space \(K\) point-to-point shortest simple paths algorithm ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ Shortest path problems with partial information: Models and algorithms for detecting dominance ⋮ An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing ⋮ Solving multi-objective traffic assignment ⋮ A label correcting approach for solving bicriterion shortest-path problems ⋮ A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes ⋮ Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network ⋮ A new multiobjective dynamic routing method for multiservice networks: modelling and performance ⋮ A multicriteria Pareto-optimal path algorithm ⋮ An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits ⋮ Routing with nonlinear multiattribute cost functions ⋮ Non-additive shortest path in the context of traffic assignment ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ Efficient solutions for the bicriteria network flow problem ⋮ An algorithm to determine a path with minimal cost/capacity ratio ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ An algorithm to determine a path with minimal cost/capacity ratio ⋮ Network reduction for the acyclic constrained shortest path problem ⋮ Range-constrained traffic assignment with multi-modal recharge for electric vehicles ⋮ A relation of dominance for the bicriterion bus routing problem ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ On algorithms for the tricriteria shortest path problem with two bottleneck objective functions ⋮ On finding dissimilar Pareto-optimal paths ⋮ On a bi-dimensional dynamic alternative routing method ⋮ Unnamed Item ⋮ Relation betwen integer linear vector optimization and multicriteria problems on groups and graphs ⋮ Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa ⋮ The determination of the path with minimum-cost norm value ⋮ A bicriterion approach for routing problems in multimedia networks ⋮ Label correcting methods to solve multicriteria shortest path problems ⋮ Shortest paths with a cost constraint: a probabilistic analysis ⋮ Finding non-dominated bicriteria shortest pairs of disjoint simple paths ⋮ Heuristics for the bi-objective path dissimilarity problem ⋮ The tricriterion shortest path problem with at least two bottleneck objective functions ⋮ An empirical investigation of some bicriterion shortest path algorithms ⋮ On the \(K\) shortest path trees problem ⋮ DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS ⋮ An algorithm for ranking paths in acyclic networks ⋮ On a multicriteria shortest path problem ⋮ On a special class of bicriterion path problems ⋮ An algorithm for the ranking of shortest paths ⋮ Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite ⋮ A parametric approach to solving bicriterion shortest path problems ⋮ The parallel drone scheduling problem with multiple drones and vehicles
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Linear multiobjective programming
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
This page was built for publication: A bicriterion shortest path algorithm
