Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit (Q3896864): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:09, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit |
scientific article |
Statements
Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit (English)
0 references
1980
0 references
weighted undirected graph
0 references
heuristics
0 references
data-independent bounds
0 references
data- dependent bounds
0 references
minimum weight Hamiltonian circuit problem
0 references
complete undirected graph
0 references
