Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OR-Library / rank | |||
Normal rank | |||
Revision as of 04:55, 29 February 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
Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (English)
0 references
28 July 2009
0 references
prize collecting
0 references
network design
0 references
