The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663): Difference between revisions

@@ Property / describes a project that uses @@
+SteinLib
@@ Property / describes a project that uses: SteinLib / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2011.08.008
+Normal rank
@@ Property / OpenAlex ID @@
+W1981354702
@@ Property / OpenAlex ID: W1981354702 / rank @@
+Normal rank
@@ Property / cites work @@
+Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
+Normal rank
@@ Property / cites work @@
+Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
+Normal rank
@@ Property / cites work @@
+md-MST is NP-hard for
@@ Property / cites work: md-MST is NP-hard for / rank @@
+Normal rank
@@ Property / cites work @@
+Using Lagrangian dual information to generate degree constrained spanning trees
+Normal rank
@@ Property / cites work @@
+A branch and cut method for the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Lower and upper bounds for the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Topological design of centralized computer networks—formulations and algorithms
+Normal rank
@@ Property / cites work @@
+The multi-weighted Steiner tree problem: A reformulation by intersection
+Normal rank
@@ Property / cites work @@
+Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves
+Normal rank
@@ Property / cites work @@
+Lagrangean relaxation. (With comments and rejoinder).
+Normal rank
@@ Property / cites work @@
+Solving Steiner tree problems in graphs to optimality
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Strong lower bounds for the prize collecting Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Trees and Cuts
@@ Property / cites work: Trees and Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the degree-constrained minimum spanning tree problem
+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 @@
+Q4254875
@@ Property / cites work: Q4254875 / rank @@
+Normal rank