Reload cost trees and network design (Q2913949): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20443
@@ Property / full work available at URL: https://doi.org/10.1002/net.20443 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2097027440
@@ Property / OpenAlex ID: W2097027440 / 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 @@
+Q3989988
@@ Property / cites work: Q3989988 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
+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 @@
+A catalog of steiner tree formulations
@@ Property / cites work: A catalog of steiner tree formulations / rank @@
+Normal rank
@@ Property / cites work @@
+Q3467420
@@ Property / cites work: Q3467420 / rank @@
+Normal rank
@@ Property / cites work @@
+The Minimum Reload s-t Path/Trail/Walk Problems
@@ Property / cites work: The Minimum Reload s-t Path/Trail/Walk Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Modeling and solving the rooted distance-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Optimum Communication Spanning Trees
@@ Property / cites work: Optimum Communication Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Reload cost problems: Minimum diameter spanning tree
+Normal rank