An experimental comparison of three heuristics for the WVCP (Q1328615): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90160-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038006607 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3994799 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3277097 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Can Parallel Branch and Bound without Communication Be Effective? / rank | |||
Normal rank | |||
Latest revision as of 16:03, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An experimental comparison of three heuristics for the WVCP |
scientific article |
Statements
An experimental comparison of three heuristics for the WVCP (English)
0 references
17 October 1994
0 references
heuristic methods
0 references
graph algorithms
0 references
simulated annealing
0 references
greedy algorithm
0 references
weighted vertex cover problem
0 references
