The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121)
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: The travelling salesman problem with neighbourhoods: MINLP solution |
scientific article; zbMATH DE number 6168658
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The travelling salesman problem with neighbourhoods: MINLP solution |
scientific article; zbMATH DE number 6168658 |
Statements
The travelling salesman problem with neighbourhoods: MINLP solution (English)
0 references
30 May 2013
0 references
non-convex and nonlinear optimization
0 references
travelling salesman problem with neighbourhoods
0 references
spatial branch-and-bound
0 references
0 references
0 references
0 references
0 references
0.7744332551956177
0 references
0.7669431567192078
0 references
0.7658642530441284
0 references
0.7642728090286255
0 references
