Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314): Difference between revisions

Latest revision as of 01:06, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations	scientific article

Statements

instance of

scholarly article

0 references

title

Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (English)

0 references

0 references

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

11 July 2018

0 references

zbMATH Keywords

min-degree constrained minimum spanning tree problem

0 references

integer programming

0 references

Lagrangian heuristic

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2017.03.001

0 references

cites work

Q4325280

0 references

Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints

0 references

Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations

0 references

Using Lagrangian dual information to generate degree constrained spanning trees

0 references

A branch and cut method for the degree-constrained minimum spanning tree problem

0 references

Q4133397

0 references

Lower and upper bounds for the degree-constrained minimum spanning tree problem

0 references

Convergence Analysis of Deflected Conditional Approximate Subgradient Methods

0 references

Solution of a Large-Scale Traveling-Salesman Problem

0 references

Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints

0 references

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

0 references

Approximating the Minimum-Degree Steiner Tree to within One of Optimal

0 references

Q4198056

0 references

Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints

0 references

Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves

0 references

Q4845371

0 references

Using separation algorithms to generate mixed integer model reformulations

0 references

A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem

0 references

The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm

0 references

VNS and second order heuristics for the min-degree constrained minimum spanning tree problem

0 references

Integer Programming Formulation of Traveling Salesman Problems

0 references

On a graph theorem by dirac

0 references

Trees and Cuts

0 references

Variable neighborhood search for the degree-constrained minimum spanning tree problem

0 references

Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem

0 references

Q4254875

0 references

Identifiers

zbMATH Open document ID

1391.90602

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1016/J.COR.2017.03.001

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1652314

@@ Property / DOI @@
-.1016/j.cor.2017.03.001
@@ Property / DOI: 10.1016/j.cor.2017.03.001 / rank @@
-Normal rank
@@ Property / cites work @@
+Q4325280
@@ Property / cites work: Q4325280 / 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 @@
+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 @@
+Q4133397
@@ Property / cites work: Q4133397 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower and upper bounds for the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum-Degree Steiner Tree to within One of Optimal
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+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 @@
+Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+Using separation algorithms to generate mixed integer model reformulations
+Normal rank
@@ Property / cites work @@
+A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+The min-degree constrained minimum spanning tree problem: formulations and 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 @@
+On a graph theorem by dirac
@@ Property / cites work: On a graph theorem by dirac / rank @@
+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 @@
+Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q4254875
@@ Property / cites work: Q4254875 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2017.03.001
@@ Property / DOI: 10.1016/J.COR.2017.03.001 / rank @@
+Normal rank