Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem (Q5690262): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:34, 7 March 2024
scientific article; zbMATH DE number 967141
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem |
scientific article; zbMATH DE number 967141 |
Statements
Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem (English)
0 references
9 October 1997
0 references
telecommunications network design
0 references
capacitated centralized processing network
0 references
cutting plane algorithm
0 references
capacitated spanning tree problem
0 references
general-demand case
0 references
branch-and-cut
0 references
vehicle routing
0 references
