A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints (Q1588841)
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: A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints |
scientific article |
Statements
A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints (English)
0 references
26 August 2003
0 references
asymmetric traveling salesman problem
0 references
precedence constraints
0 references
branch \& cut
0 references
