Exact algorithms for the traveling salesman problem with draft limits (Q2256207)
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: Exact algorithms for the traveling salesman problem with draft limits |
scientific article; zbMATH DE number 6405979
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for the traveling salesman problem with draft limits |
scientific article; zbMATH DE number 6405979 |
Statements
Exact algorithms for the traveling salesman problem with draft limits (English)
0 references
19 February 2015
0 references
draft limits
0 references
traveling salesman
0 references
cutting planes
0 references
column generation
0 references
extended formulation
0 references
0 references
0 references
0 references
0.8625162839889526
0 references
0.8019284605979919
0 references
0.7889714241027832
0 references
0.7705810070037842
0 references
