New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints |
scientific article |
Statements
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (English)
0 references
19 November 2004
0 references
Asymmetric traveling salesman problem
0 references
Precedence constraints
0 references
Subtourelimination constraints
0 references
0 references
0 references
0 references
0 references
