Network design with edge-connectivity and degree constraints (Q839639)
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: Network design with edge-connectivity and degree constraints |
scientific article; zbMATH DE number 5601532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Network design with edge-connectivity and degree constraints |
scientific article; zbMATH DE number 5601532 |
Statements
Network design with edge-connectivity and degree constraints (English)
0 references
2 September 2009
0 references
appproximation algorithm
0 references
degree constraint
0 references
edge-connectivity
0 references
\((m,n)\)-VRP
0 references
TSP
0 references
vehicle routing problem
0 references
0.9991216063499452
0 references
0.8866748213768005
0 references
0.839289665222168
0 references
0.8339933156967163
0 references
0.833482027053833
0 references
