Hybrid heuristic algorithms for set covering. (Q1406642): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0305-0548(97)00084-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1970696450 / rank | |||
Normal rank | |||
Latest revision as of 08:48, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hybrid heuristic algorithms for set covering. |
scientific article |
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
