A new integer programming formulation of the graphical traveling salesman problem (Q5918436)
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: A new integer programming formulation of the graphical traveling salesman problem |
scientific article; zbMATH DE number 7450171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new integer programming formulation of the graphical traveling salesman problem |
scientific article; zbMATH DE number 7450171 |
Statements
A new integer programming formulation of the graphical traveling salesman problem (English)
0 references
21 December 2021
0 references
linear program
0 references
relaxation
0 references
TSP
0 references
traveling salesman problem
0 references
GTSP
0 references
graphical traveling salesman problem
0 references
0 references
0 references
0.990358293056488
0 references
0.7836726903915405
0 references
0.7667709589004517
0 references
0.7636518478393555
0 references
