The Minimum Reload s-t Path/Trail/Walk Problems
From MaRDI portal
Recommendations
- The minimum reload \(s-t\) path, trail and walk problems
- On minimum reload cost paths, tours, and flows
- Minimum-link paths revisited
- On the complexity of minimum-link path problems
- scientific article; zbMATH DE number 6707504
- MIN-MAX quickest path problems
- The complexity of a minimum reload cost diameter problem
- On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
- Min-sum 2-paths problems
- Min-sum 2-paths problems
Cites work
- scientific article; zbMATH DE number 795216 (Why is no real title available?)
- On minimum reload cost paths, tours, and flows
- Paths and trails in edge-colored graphs
- Reload cost problems: Minimum diameter spanning tree
- Reload cost trees and network design
- The complexity of a minimum reload cost diameter problem
Cited in
(8)- On minimum reload cost cycle cover
- Reload cost trees and network design
- On minimum reload cost paths, tours, and flows
- On solving the quadratic shortest path problem
- Complexity of edge coloring with minimum reload/changeover costs
- Reload cost problems: Minimum diameter spanning tree
- Minimum <scp>color‐degree</scp> perfect b‐matchings
- The minimum reload \(s-t\) path, trail and walk problems
This page was built for publication: The Minimum Reload s-t Path/Trail/Walk Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599109)