Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs (Q1969869): Difference between revisions

@@ Property / cites work @@
+A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
+Normal rank
@@ Property / cites work @@
+Finding minimum cost directed trees with demands and capacities
+Normal rank
@@ Property / cites work @@
+Topological design of centralized computer networks—formulations and algorithms
+Normal rank
@@ Property / cites work @@
+Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
+Normal rank
@@ Property / cites work @@
+A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
+Normal rank
@@ Property / cites work @@
+Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank