Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214)
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 6636414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounding procedure for the asymmetric quadratic traveling salesman problem |
scientific article; zbMATH DE number 6636414 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0.8143765926361084
0 references
0.8143765926361084
0 references
0.8081140518188477
0 references
0.7944620847702026
0 references
0.7924658060073853
0 references
