A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (Q6066244): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:52, 10 July 2024
scientific article; zbMATH DE number 7775912
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints |
scientific article; zbMATH DE number 7775912 |
Statements
A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (English)
0 references
12 December 2023
0 references
hop constraint
0 references
hop-indexed model
0 references
integer programming
0 references
linear programming relaxation
0 references
network design
0 references
Steiner tree
0 references
