Recommendations
- Finding the k Shortest Paths
- Finding the K shortest hyperpaths
- Finding k simple shortest paths and cycles
- Finding the K Shortest Loopless Paths in a Network
- Finding the k shortest simple paths
- A quick method for finding shortest pairs of disjoint paths
- Finding the \(k\) quickest simple paths in a network
- Near-shortest and K-shortest simple paths
Cites work
- A bi-objective approach to discrete cost-bottleneck location problems
- A comparison of solution strategies for biobjective shortest path problems
- A heuristic approach to the overnight security service problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Handbooks in operations Research \& management science: Transportation
- scientific article; zbMATH DE number 3833720 (Why is no real title available?)
- Modeling of transport risk for hazardous materials
- Multicriteria Optimization
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Multiobjective programming and planning
- Multi‐objective combinatorial optimization problems: A survey
- Network flows. Theory, algorithms, and applications.
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- On a relaxed maximally disjoint path pair problem: a bicriteria approach
- On finding dissimilar Pareto-optimal paths
- On finding dissimilar paths
- The k-dissimilar vehicle routing problem
- The mixed capacitated arc routing problem with non-overlapping routes
- The multiple shortest path problem with path deconfliction
Cited in
(10)- Finding non-dominated bicriteria shortest pairs of disjoint simple paths
- Finding an induced path that is not a shortest path
- Finding the Minimum-Weight k-Path
- Searching for Differential Paths in MD4
- Finding the k Shortest Paths
- Finding the K mean-standard deviation shortest paths under travel time uncertainty
- Conflict-free tow train routing in just-in-time assembly lines
- Finding next-to-shortest paths in a graph
- Calculating distances for dissimilar strings: the shortest path formulation revisited
- Finding disjoint paths with related path costs
This page was built for publication: Finding shortest and dissimilar paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6071084)
