Problem statements for \(k\)-node shortest path and \(k\)-node shortest cycle in a complete graph (Q289795)
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: Problem statements for k-node shortest path and k-node shortest cycle in a complete graph |
scientific article; zbMATH DE number 6587917
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Problem statements for \(k\)-node shortest path and \(k\)-node shortest cycle in a complete graph |
scientific article; zbMATH DE number 6587917 |
Statements
Problem statements for \(k\)-node shortest path and \(k\)-node shortest cycle in a complete graph (English)
0 references
31 May 2016
0 references
complete graph
0 references
shortest path
0 references
linear programming problem
0 references
Hamiltonian path
0 references
Hamiltonian cycle
0 references
traveling salesman problem
0 references
0.7465705275535583
0 references
0.7206204533576965
0 references
