A branch and bound algorithm for the capacitated minimum spanning tree problem (Q3141109)
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 444632
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for the capacitated minimum spanning tree problem |
scientific article; zbMATH DE number 444632 |
Statements
A branch and bound algorithm for the capacitated minimum spanning tree problem (English)
0 references
16 August 1994
0 references
undirected graph
0 references
center
0 references
capacitated minimum spanning tree
0 references
network design
0 references
vehicle routing
0 references
branch and bound
0 references
Lagrangean relaxation
0 references
0.9355491
0 references
0.9333494
0 references
0.93030936
0 references
0.9287271
0 references
0.9281805
0 references
0 references
0.92274654
0 references
0.92254066
0 references
