Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit (Q3896864): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.28.5.1219 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2148893547 / rank | |||
Normal rank | |||
Latest revision as of 00:51, 20 March 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
