The Minimum Reload s-t Path/Trail/Walk Problems (Q3599109): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-95891-8_55
+Normal rank
@@ Property / OpenAlex ID @@
+W2127499975
@@ Property / OpenAlex ID: W2127499975 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths and trails in edge-colored graphs
@@ Property / cites work: Paths and trails in edge-colored graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On minimum reload cost paths, tours, and flows
@@ Property / cites work: On minimum reload cost paths, tours, and flows / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of a minimum reload cost diameter problem
+Normal rank
@@ Property / cites work @@
+Reload cost trees and network design
@@ Property / cites work: Reload cost trees and network design / rank @@
+Normal rank
@@ Property / cites work @@
+Q4845365
@@ Property / cites work: Q4845365 / rank @@
+Normal rank
@@ Property / cites work @@
+Reload cost problems: Minimum diameter spanning tree
+Normal rank