SCHEDULING TWO SALESMEN IN A NETWORK (Q3126019)
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 993811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SCHEDULING TWO SALESMEN IN A NETWORK |
scientific article; zbMATH DE number 993811 |
Statements
SCHEDULING TWO SALESMEN IN A NETWORK (English)
0 references
7 August 1997
0 references
NP-completeness
0 references
Steiner tree
0 references
two-server problem
0 references
0.7986134
0 references
0 references
0.7928373
0 references
0 references
0.77684784
0 references
0.7757032
0 references
0.7748203
0 references
0.7747124
0 references
