Pages that link to "Item:Q3599109"
From MaRDI portal
The following pages link to The Minimum Reload s-t Path/Trail/Walk Problems (Q3599109):
Displaying 9 items.
- The minimum reload \(s-t\) path, trail and walk problems (Q987690) (← links)
- On minimum reload cost cycle cover (Q2883554) (← links)
- Reload cost trees and network design (Q2913949) (← links)
- On minimum reload cost paths, tours, and flows (Q3008920) (← links)
- On Solving the Quadratic Shortest Path Problem (Q3386757) (← links)
- Complexity of edge coloring with minimum reload/changeover costs (Q5226172) (← links)
- Minimum reload cost graph factors (Q5918369) (← links)
- Reload cost problems: Minimum diameter spanning tree (Q5948962) (← links)
- Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings (Q6087129) (← links)