A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints (Q3471856)
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 4139491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints |
scientific article; zbMATH DE number 4139491 |
Statements
A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints (English)
0 references
1989
0 references
non-deterministic traveling salesman problem
0 references
heuristic
0 references
branch-and-cut
0 references
0.7904569506645203
0 references
0.7660328149795532
0 references
0.7649394869804382
0 references
0.7636231184005737
0 references
0.7627196907997131
0 references
