Note: A local-search heuristic for large set-covering problems (Q4859572)
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: Note: A local-search heuristic for large set-covering problems |
scientific article; zbMATH DE number 830006
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note: A local-search heuristic for large set-covering problems |
scientific article; zbMATH DE number 830006 |
Statements
1 February 1996
0 references
local-search heuristic
0 references
large non-unicost set-covering problems
0 references
simulated annealing
0 references
Note: A local-search heuristic for large set-covering problems (English)
0 references
