The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675): Difference between revisions

@@ Property / cites work @@
+Revisiting dynamic programming for finding optimal subtrees in trees
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure
+Normal rank
@@ Property / cites work @@
+The Steiner tree polytope and related polyhedra
@@ Property / cites work: The Steiner tree polytope and related polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Tree polytope on 2-trees
@@ Property / cites work: Tree polytope on 2-trees / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing Matrices into Blocks
@@ Property / cites work: Decomposing Matrices into Blocks / rank @@
+Normal rank
@@ Property / cites work @@
+Integer programming approaches to facilities layout models with forbidden areas
+Normal rank
@@ Property / cites work @@
+New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
+Normal rank
@@ Property / cites work @@
+Q4208337
@@ Property / cites work: Q4208337 / rank @@
+Normal rank
@@ Property / cites work @@
+An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
+Normal rank
@@ Property / cites work @@
+New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
+Normal rank
@@ Property / cites work @@
+Spanning Trees—Short or Small
@@ Property / cites work: Spanning Trees—Short or Small / rank @@
+Normal rank
@@ Property / cites work @@
+Q4216482
@@ Property / cites work: Q4216482 / rank @@
+Normal rank
@@ Property / cites work @@
+Local search algorithms for the \(k\)-cardinality tree problem.
+Normal rank
@@ Property / cites work @@
+Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem
+Normal rank
@@ Property / cites work @@
+\(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulations for the k-Cardinality Tree Problem
+Normal rank
@@ Property / cites work @@
+Q3760270
@@ Property / cites work: Q3760270 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Solving the Steiner Tree Problem on a Graph Using Branch and Cut
+Normal rank
@@ Property / cites work @@
+Q4540078
@@ Property / cites work: Q4540078 / rank @@
+Normal rank
@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+Normal rank
@@ Property / cites work @@
+Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
+Normal rank
@@ Property / cites work @@
+Solving Steiner tree problems in graphs with Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+The volume algorithm revisited: relation with bundle methods
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
+Normal rank
@@ Property / cites work @@
+A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
+Normal rank
@@ Property / cites work @@
+Q4105990
@@ Property / cites work: Q4105990 / rank @@
+Normal rank