Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LEMON / rank | |||
Normal rank | |||
Revision as of 19:02, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounding procedure for the asymmetric quadratic traveling salesman problem |
scientific article |
Statements
Lower bounding procedure for the asymmetric quadratic traveling salesman problem (English)
0 references
7 October 2016
0 references
traveling salesman
0 references
reformulation-linearization technique
0 references
cycle cover
0 references
column generation
0 references
lower bound
0 references
