New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799)
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: New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints |
scientific article; zbMATH DE number 2116852
| 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; zbMATH DE number 2116852 |
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
0.9295741
0 references
0.9082235
0 references
0.90152955
0 references
0.89702475
0 references
0.8966298
0 references
0.8915683
0 references
0.8875952
0 references
0.8863471
0 references
0.8850974
0 references
