The merchant subtour problem (Q1411616)
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: The merchant subtour problem |
scientific article; zbMATH DE number 1998195
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The merchant subtour problem |
scientific article; zbMATH DE number 1998195 |
Statements
The merchant subtour problem (English)
0 references
29 October 2003
0 references
tabu-search algorithm
0 references
branch-and-prince-and-cut algorithm
0 references
branch-and-bound tree
0 references
lifted knapsack inequalities
0 references
lifted cycle inequalities
0 references
mod-\(k\) cuts
0 references
