A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints |
scientific article; zbMATH DE number 6833438
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints |
scientific article; zbMATH DE number 6833438 |
Statements
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (English)
0 references
1 February 2018
0 references
mixed integer programming
0 references
exact computation
0 references
hop-constrained trees
0 references
branch-and-cut
0 references
layered graph
0 references
node-based model
0 references
0 references
0 references
0 references
0 references
0 references
0 references
