A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q2494810)
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 5038119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints |
scientific article; zbMATH DE number 5038119 |
Statements
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (English)
0 references
30 June 2006
0 references
asymmetric traveling salesman problem (ATSP)
0 references
reformulation-linearization technique (RLT)
0 references
polynomial length formulations
0 references
precedence constraints
0 references
0 references
0 references
0 references
0 references
0.8902617692947388
0 references
0.8414813280105591
0 references
0.8271039724349976
0 references
0.825336754322052
0 references
