An exact algorithm for the capacitated shortest spanning arborescence (Q1908299): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Pathology of Traveling-Salesman Subtour-Elimination Algorithms
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the multiple depot vehicle scheduling problem
+Normal rank
@@ Property / cites work @@
+New lower bounds for the symmetric travelling salesman 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 @@
+Optimum branchings
@@ Property / cites work: Optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4205235
@@ Property / cites work: Q4205235 / rank @@
+Normal rank
@@ Property / cites work @@
+A new dominance procedure for combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+An Additive Bounding Procedure for Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+An additive bounding procedure for the asymmetric travelling salesman problem
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
+Normal rank
@@ Property / cites work @@
+A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
+Normal rank
@@ Property / cites work @@
+Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for a family of matroid intersection problems
+Normal rank
@@ Property / cites work @@
+Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
+Normal rank
@@ Property / cites work @@
+Computing capacitated minimal spanning trees efficiently
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the capacitated minimum spanning tree problem
+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 @@
+Finding optimum branchings
@@ Property / cites work: Finding optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+An Exact Algorithm for the Vehicle Routing Problem with Backhauls
+Normal rank
@@ Property / cites work @@
+A heuristic algorithm for the asymmetric capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the asymmetrical capacitated vehicle routing problem
+Normal rank