Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136): Difference between revisions

Latest revision as of 20:52, 1 July 2024

scientific article; zbMATH DE number 5587973

Language	Label	Description	Also known as
English	Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints	scientific article; zbMATH DE number 5587973

Statements

instance of

scholarly article

0 references

title

Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (English)

0 references

zbMATH Open document ID

0 references

0 references

0 references

Jean-François Cordeau

0 references

0 references

0 references

28 July 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

prize collecting

0 references

network design

0 references

describes a project that uses

OR-Library

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1002/net.20274

0 references

OpenAlex ID

W4245460500

0 references

cites work

A note on the prize collecting traveling salesman problem

0 references

Local search with perturbations for the prize-collecting Steiner tree problem in graphs

0 references

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

0 references

The Steiner tree problem. II: Properties and classes of facets

0 references

Q2768267

0 references

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

0 references

A comparative analysis of several formulations for the generalized minimum spanning tree problem

0 references

Facets of two Steiner arborescence polyhedra

0 references

The Complexity of Computing Steiner Minimal Trees

0 references

Steiner Minimal Trees

0 references

The Steiner tree polytope and related polyhedra

0 references

A General Approximation Technique for Constrained Forest Problems

0 references

The prize-collecting generalized minimum spanning tree problem

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

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

0 references

Q4952698

0 references

A test problem generator for the Steiner problem in graphs

0 references

Solving Steiner tree problems in graphs to optimality

0 references

Strong lower bounds for the prize collecting Steiner problem in graphs

0 references

Strong formulations for network design problems with connectivity requirements

0 references

Tree polytope on 2-trees

0 references

Integer Programming Formulation of Traveling Salesman Problems

0 references

The node-weighted steiner tree problem

0 references

The Steiner tree problem with hop constraints

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5191136

@@ Property / describes a project that uses @@
+OR-Library
@@ Property / describes a project that uses: OR-Library / 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.1002/net.20274
@@ Property / full work available at URL: https://doi.org/10.1002/net.20274 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4245460500
@@ Property / OpenAlex ID: W4245460500 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the prize collecting traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Local search with perturbations for the prize-collecting Steiner tree problem in graphs
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem. II: Properties and classes of facets
+Normal rank
@@ Property / cites work @@
+Q2768267
@@ Property / cites work: Q2768267 / rank @@
+Normal rank
@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+Normal rank
@@ Property / cites work @@
+A comparative analysis of several formulations for the generalized minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Facets of two Steiner arborescence polyhedra
@@ Property / cites work: Facets of two Steiner arborescence polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Computing Steiner Minimal Trees
@@ Property / cites work: The Complexity of Computing Steiner Minimal Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner Minimal Trees
@@ Property / cites work: Steiner Minimal Trees / rank @@
+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 @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+The prize-collecting generalized minimum spanning tree problem
+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 @@
+A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q4952698
@@ Property / cites work: Q4952698 / rank @@
+Normal rank
@@ Property / cites work @@
+A test problem generator for the Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+Solving Steiner tree problems in graphs to optimality
+Normal rank
@@ Property / cites work @@
+Strong lower bounds for the prize collecting Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+Strong formulations for network design problems with connectivity requirements
+Normal rank
@@ Property / cites work @@
+Tree polytope on 2-trees
@@ Property / cites work: Tree polytope on 2-trees / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+The node-weighted steiner tree problem
@@ Property / cites work: The node-weighted steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem with hop constraints
@@ Property / cites work: The Steiner tree problem with hop constraints / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5191136