Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem (Q5690262)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 967141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8324896097183228
0 references
0.8230008482933044
0 references
0.8208971619606018
0 references
0.8181147575378418
0 references
