Hybrid heuristic algorithms for set covering. (Q1406642)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1975773
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid heuristic algorithms for set covering. |
scientific article; zbMATH DE number 1975773 |
Statements
Hybrid heuristic algorithms for set covering. (English)
0 references
7 September 2003
0 references
Computational complexity
0 references
Algorithms
0 references
Heuristic methods
0 references
Mathematical models
0 references
Integer programming
0 references
Linear programming
0 references
Recurrent neural networks
0 references
Constraint theory
0 references
Minimal set covering
0 references
0 references
0 references
0.8174322247505188
0 references
0.8036185503005981
0 references
0.8018724918365479
0 references
0.7967092394828796
0 references
0.7922871112823486
0 references
