A bicriterion shortest path algorithm
From MaRDI portal
Cites work
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- A note on two problems in connexion with graphs
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 3478624 (Why is no real title available?)
- 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
Cited in
(75)- 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
- On the \(K\) shortest path trees problem
- An algorithm for ranking paths in acyclic networks
- The shortest path problem with two objective functions
- A multicriteria Pareto-optimal path algorithm
- Efficient solutions for the bicriteria network flow problem
- Network reduction for the acyclic constrained shortest path problem
- An algorithm for the ranking of shortest paths
- 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.
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
- Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
- An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing
- Non-additive shortest path in the context of traffic assignment
- An empirical investigation of some bicriterion shortest path algorithms
- Multiobjective routing problems
- A general decomposition approach for multi-criteria decision trees
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- A label correcting approach for solving bicriterion shortest-path problems
- Range-constrained traffic assignment with multi-modal recharge for electric vehicles
- A relation of dominance for the bicriterion bus routing problem
- Shortest paths with a cost constraint: a probabilistic analysis
- The parallel drone scheduling problem with multiple drones and vehicles
- 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
- Speeding up Martins' algorithm for multiple objective shortest path problems
- A new multiobjective dynamic routing method for multiservice networks: modelling and performance
- Multicriteria adaptive paths in stochastic, time-varying networks
- On the bicriterion - minimal cost/minimal label - spanning tree problem
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- Relation betwen integer linear vector optimization and multicriteria problems on groups and graphs
- The minmax regret robust shortest path problem in a finite multi-scenario model
- A genetic algorithms to solve the bicriteria shortest path problem
- An exact method to generate all nondominated spanning trees
- A hierarchical multiobjective routing model for MPLS networks with two service classes
- Bicriteria path problem minimizing the cost and minimizing the number of labels
- 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
- An efficient time and space K point-to-point shortest simple paths algorithm
- Solving multi-objective traffic assignment
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
- Deviation algorithms for ranking shortest paths
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- On a bi-dimensional dynamic alternative routing method
- An algorithm to determine a path with minimal cost/capacity ratio
- An algorithm to determine a path with minimal cost/capacity ratio
- Label correcting methods to solve multicriteria shortest path problems
- On a relaxed maximally disjoint path pair problem: a bicriteria approach
- 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
- Routing with nonlinear multiattribute cost functions
- Complete Pareto front of the minimal length maximal capacity shortest path problem
- On finding dissimilar Pareto-optimal paths
- On a multicriteria shortest path problem
- On a special class of bicriterion path problems
- A parametric approach to solving bicriterion shortest path problems
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- An interactive approach to identify the best compromise solution for two objective shortest path problems
- Optimal paths in bi-attribute networks with fractional cost functions
- Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
- An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- A comparison of solution strategies for biobjective shortest path problems
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
This page was built for publication: A bicriterion shortest path algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1166423)
