Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 05:29, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics |
scientific article |
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
