Design of capacitated degree constrained min-sum arborescence (Q2085507): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A good algorithm for smallest spanning trees with a degree constraint
+Normal rank
@@ Property / cites work @@
+Topological design of centralized computer networks—formulations and algorithms
+Normal rank
@@ Property / cites work @@
+Edge exchanges in the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A Lagrangean approach to the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A branch and cut method for the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Using Lagrangian dual information to generate degree constrained spanning trees
+Normal rank
@@ Property / cites work @@
+Lower and upper bounds for the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q4350039
@@ Property / cites work: Q4350039 / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
+Normal rank
@@ Property / cites work @@
+The Held—Karp algorithm and degree-constrained minimum 1-trees
+Normal rank
@@ Property / cites work @@
+The complexity of the capacitated tree problem
@@ Property / cites work: The complexity of the capacitated tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Computing capacitated minimal spanning trees efficiently
+Normal rank
@@ Property / cites work @@
+Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
+Normal rank
@@ Property / cites work @@
+Heuristics with Constant Error Guarantees for the Design of Tree Networks
+Normal rank
@@ Property / cites work @@
+The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
+Normal rank
@@ Property / cites work @@
+Q4944737
@@ Property / cites work: Q4944737 / rank @@
+Normal rank
@@ Property / cites work @@
+Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+The Capacitated Minimum Spanning Tree
@@ Property / cites work: The Capacitated Minimum Spanning Tree / rank @@
+Normal rank
@@ Property / cites work @@
+Centralized teleprocessing network design
@@ Property / cites work: Centralized teleprocessing network design / rank @@
+Normal rank
@@ Property / cites work @@
+Savings based ant colony optimization for the capacitated minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank