An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664): Difference between revisions

@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing constrained subtrees of trees
@@ Property / cites work: Optimizing constrained subtrees of trees / rank @@
+Normal rank
@@ Property / cites work @@
+A unified limited column generation approach for facility location problems on trees
+Normal rank
@@ Property / cites work @@
+A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
+Normal rank
@@ Property / cites work @@
+On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q3751378
@@ Property / cites work: Q3751378 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic algorithms for the multiple knapsack problem
+Normal rank
@@ Property / cites work @@
+An Algorithm for Large Zero-One Knapsack Problems
@@ Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank