Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561): Difference between revisions

Latest revision as of 05:00, 4 July 2024

scientific article; zbMATH DE number 5909177

Language	Label	Description	Also known as
English	Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs	scientific article; zbMATH DE number 5909177

Statements

instance of

scholarly article

0 references

title

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (English)

0 references

zbMATH Open document ID

1218.90201

0 references

DOI

10.1007/s10107-009-0297-2

0 references

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

17 June 2011

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

tree algorithms

0 references

integer programming: formulations

0 references

cutting planes

0 references

describes a project that uses

SteinLib

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10107-009-0297-2

0 references

0 references

0 references

The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets

0 references

The 2-hop spanning tree problem

0 references

Notes on polyhedra associated with hop-constrained paths

0 references

Q5294063

0 references

Q4198056

0 references

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

0 references

Multicommodity flow models for spanning trees with hop constraints

0 references

Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

0 references

Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees

0 references

A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees

0 references

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

0 references

A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem

0 references

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

0 references

The Steiner tree problem

0 references

Design of Survivable Networks: A survey

0 references

Solving Steiner tree problems in graphs to optimality

0 references

Q3760270

0 references

Q4845371

0 references

Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem

0 references

Q5294069

0 references

Q2741494

0 references

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

0 references

Q3874241

0 references

Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation

0 references

A dual ascent approach for steiner tree problems on a directed graph

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5892561

@@ 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.1007/s10107-009-0297-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2100344930
@@ Property / OpenAlex ID: W2100344930 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4325280
@@ Property / cites work: Q4325280 / rank @@
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
+Normal rank
@@ Property / cites work @@
+The 2-hop spanning tree problem
@@ Property / cites work: The 2-hop spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Notes on polyhedra associated with hop-constrained paths
+Normal rank
@@ Property / cites work @@
+Q5294063
@@ Property / cites work: Q5294063 / rank @@
+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 @@
+Multicommodity flow models for spanning trees with hop constraints
+Normal rank
@@ Property / cites work @@
+Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
+Normal rank
@@ Property / cites work @@
+Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
+Normal rank
@@ Property / cites work @@
+A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
+Normal rank
@@ Property / cites work @@
+An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
+Normal rank
@@ Property / cites work @@
+A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem
@@ Property / cites work: The Steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Design of Survivable Networks: A survey
@@ Property / cites work: Design of Survivable Networks: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Steiner tree problems in graphs to optimality
+Normal rank
@@ Property / cites work @@
+Q3760270
@@ Property / cites work: Q3760270 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Q5294069
@@ Property / cites work: Q5294069 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2741494
@@ Property / cites work: Q2741494 / rank @@
+Normal rank
@@ Property / cites work @@
+A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
+Normal rank
@@ Property / cites work @@
+Q3874241
@@ Property / cites work: Q3874241 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
+Normal rank
@@ Property / cites work @@
+A dual ascent approach for steiner tree problems on a directed graph
+Normal rank