An approximation algorithm for a bottleneck traveling salesman problem (Q1026245)
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: An approximation algorithm for a bottleneck traveling salesman problem |
scientific article; zbMATH DE number 5569527
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for a bottleneck traveling salesman problem |
scientific article; zbMATH DE number 5569527 |
Statements
An approximation algorithm for a bottleneck traveling salesman problem (English)
0 references
24 June 2009
0 references
bottleneck traveling salesman problem
0 references
job sequencing
0 references
two-machine flowshop
0 references
reconstruction from inaccurate adjacency
0 references
nuclear magnetic resonance spectroscopy
0 references
0 references
