Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114)
From MaRDI portal
!
WARNING
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 6650700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations |
scientific article; zbMATH DE number 6650700 |
Statements
Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (English)
0 references
10 November 2016
0 references
multiple asymmetric traveling salesmen problem
0 references
precedence constraints
0 references
sequential ordering problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.844839870929718
0 references
0.8414813280105591
0 references
0.8242621421813965
0 references
0.82346510887146
0 references
0.8192566633224487
0 references
