Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833)
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 6258992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics |
scientific article; zbMATH DE number 6258992 |
Statements
Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (English)
0 references
18 February 2014
0 references
traveling salesman problem
0 references
branch-and-bound
0 references
branch-and-cut
0 references
heuristical methods
0 references
exact methods
0 references
bioinformatics
0 references
0 references
0 references
0.8426656126976013
0 references
0.8000531792640686
0 references
0.796350359916687
0 references
0.7857227921485901
0 references
0.7842854261398315
0 references
