Label correcting methods to solve multicriteria shortest path problems
From MaRDI portal
(Redirected from Publication:5956971)
Recommendations
- On a multicriteria shortest path problem
- A label correcting approach for solving bicriterion shortest-path problems
- The interactive analysis of the multicriteria shortest path problem by the reference point method.
- Solving min-max shortest-path problems on a network
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A bicriterion shortest path algorithm
- A label correcting approach for solving bicriterion shortest-path problems
- A multicriteria Pareto-optimal path algorithm
- A parametric approach to solving bicriterion shortest path problems
- A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
- An empirical investigation of some bicriterion shortest path algorithms
- An interactive approach to identify the best compromise solution for two objective shortest path problems
- An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
- An interactive procedure using domination cones for bicriterion shortest path problems
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Generalized dynamic programming for multicriteria optimization
- Multiobjective programming and planning
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- On a multicriteria shortest path problem
- Parallel asynchronous label-correcting methods for shortest paths
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
Cited in
(36)- Solving min-max shortest-path problems on a network
- An exact method for the biobjective shortest path problem for large-scale road networks
- A biobjective Dijkstra algorithm
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- Least expected time paths in stochastic schedule-based transit networks
- A simple and fast label correcting algorithm for shortest paths
- An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- A label correcting algorithm with storing partial solutions to solving the bus routing problem
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
- Extensions of labeling algorithms for multi-objective uncertain shortest path problems
- Finding all nondominated points of multi-objective integer programs
- scientific article; zbMATH DE number 6747327 (Why is no real title available?)
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- A robust optimization approach with probe-able uncertainty
- On a multicriteria shortest path problem
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- A new approach for the multiobjective minimum spanning tree
- A comparison of solution strategies for biobjective shortest path problems
- The determination of the path with minimum-cost norm value
- Bi-objective robust optimisation
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- 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
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
- Path based algorithms for metro network design
- A personalized urban multicriteria shortest path stochastic optimization algorithm
- Dimensionality reduction in multiobjective shortest path search
- Minimum cost path problems with relays
- An aggregate label setting policy for the multi-objective shortest path problem
- Solving multi-objective traffic assignment
- Common route planning for carpoolers -- model and exact algorithm
- Tree-deletion pruning in label-correcting algorithms for the multiobjective shortest path problem
- The Steiner bi-objective shortest path problem
- Speeding up Martins' algorithm for multiple objective shortest path problems
This page was built for publication: Label correcting methods to solve multicriteria shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956971)
