Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem (Q4584873)
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: Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem |
scientific article; zbMATH DE number 6931684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem |
scientific article; zbMATH DE number 6931684 |
Statements
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem (English)
0 references
4 September 2018
0 references
traveling salesman
0 references
precedence constraints
0 references
integer linear programming
0 references
reformulation
0 references
cutting plane algorithm
0 references
valid inequalities
0 references
0.8567689061164856
0 references
0.8371263742446899
0 references
0.825336754322052
0 references
0.8242621421813965
0 references
0.822830080986023
0 references
