On a multicriteria shortest path problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 792650
- An empirical investigation of some bicriterion shortest path algorithms
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Label correcting methods to solve multicriteria shortest path problems
- Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
Cites work
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 3726107 (Why is no real title available?)
- scientific article; zbMATH DE number 3478624 (Why is no real title available?)
- scientific article; zbMATH DE number 3485483 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- A bicriterion shortest path algorithm
- A network simplex method
- Data Structures and Computer Science Techniques in Operations Research
- Linear multiobjective programming
Cited in
(only showing first 100 items - show all)- Solving the multi‐objective bike routing problem by meta‐heuristic algorithms
- Algorithms for time-dependent bicriteria shortest path problems
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- Network reduction for the acyclic constrained shortest path problem
- The interactive analysis of the multicriteria shortest path problem by the reference point method.
- Tree-deletion pruning in label-correcting algorithms for the multiobjective shortest path problem
- Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Fuzzy shortest path problems incorporating interactivity among paths.
- Finding Multi-Constrained Multiple Shortest Paths
- A DEA-based approach for finding a favorable multi-objective shortest path
- The Steiner bi-objective shortest path problem
- Targeted multiobjective Dijkstra algorithm
- An improved multiobjective shortest path algorithm
- A comparison of distance metrics for the multi-objective pathfinding problem
- Optimal control with budget constraints and resets
- Bicriteria path problem minimizing the cost and minimizing the number of labels
- Multicriteria adaptive paths in stochastic, time-varying networks
- On the minimum \(s-t\) cut problem with budget constraints
- Search for the best compromise solution on multiobjective shortest path problem
- Speeding up Martins' algorithm for multiple objective shortest path problems
- Solving min-max shortest-path problems on a network
- SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY
- Shortest paths with shortest detours. A biobjective routing problem
- An exact method for the biobjective shortest path problem for large-scale road networks
- Routing with nonlinear multiattribute cost functions
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- A biobjective Dijkstra algorithm
- Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa
- The fuzzy shortest path length and the corresponding shortest path in a network
- Connectedness of efficient solutions in multiple objective combinatorial optimization
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- Energy-optimal routes for battery electric vehicles
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
- Multi-objective and multi-constrained non-additive shortest path problems
- An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem
- Candidate sets for alternative routes in road networks
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
- A bicriterion approach for routing problems in multimedia networks
- A preference-based approach to spanning trees and shortest paths problems
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint
- Shortest paths with ordinal weights
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- Optimization problems with color-induced budget constraints
- Coordinated routing of electric commercial vehicles with intra-route recharging and en-route battery swapping
- Generalization of multicriterion problem on determination of the shortest paths in oriented graph
- A relation of dominance for the bicriterion bus routing problem
- On computing Pareto optimal paths in weighted time-dependent networks
- An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations
- An extended shortest path problem: a data envelopment analysis approach
- The shortest path problem with discrete fuzzy arc lengths
- A new algorithm for the discrete fuzzy shortest path problem in a network
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
- Optimization problems with color-induced budget constraints
- Framing algorithms for approximate multicriteria shortest paths
- Variants of shortest path problems
- Efficient solutions for the bicriteria network flow problem
- Extensions of labeling algorithms for multi-objective uncertain shortest path problems
- Bi-directional search for robust routes in time-dependent bi-criteria road networks
- Minmax robustness for multi-objective optimization problems
- Multiobjective shortest path problems with lexicographic goal-based preferences
- Two exact algorithms for the traveling umpire problem
- Finding all nondominated points of multi-objective integer programs
- Multiobjective (Combinatorial) optimisation-some thoughts on applications
- scientific article; zbMATH DE number 176744 (Why is no real title available?)
- A lower bound of the Choquet integral integrated within martins' algorithm
- scientific article; zbMATH DE number 792650 (Why is no real title available?)
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- An empirical investigation of some bicriterion shortest path algorithms
- Generalized multiple objective bottleneck problems
- On finding dissimilar Pareto-optimal paths
- The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
- Minimal paths on ordered graphs
- A robust optimization approach with probe-able uncertainty
- Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
- A simulated annealing for multi-criteria network path problems
- Bicriteria shortest path in networks of queues
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- A comparison of solution strategies for biobjective shortest path problems
- The determination of the path with minimum-cost norm value
- The constrained shortest path problem with stochastic correlated link travel times
- Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- A multicriteria Pareto-optimal path algorithm
- scientific article; zbMATH DE number 1558116 (Why is no real title available?)
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
- The tricriterion shortest path problem with at least two bottleneck objective functions
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Combinatorial optimization in system configuration design
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- Choquet optimal set in biobjective combinatorial optimization
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
- Multiobjective routing of hazardous materials in stochastic networks
- Model and algorithm for shortest path of multiple objectives
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
This page was built for publication: On a multicriteria shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790051)
