An exact algorithm for the maximal covering problem (Q4883162)
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: An exact algorithm for the maximal covering problem |
scientific article; zbMATH DE number 895005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the maximal covering problem |
scientific article; zbMATH DE number 895005 |
Statements
1 July 1996
0 references
robust, exact algorithm
0 references
maximal covering problem
0 references
dual-based solution methods
0 references
greedy heuristics
0 references
branch-and-bound
0 references
bounding schemes
0 references
Lagrangian relaxation
0 references
An exact algorithm for the maximal covering problem (English)
0 references
0.93440276
0 references
0.9197462
0 references
0.9166683
0 references
0.91432685
0 references
0.9137909
0 references
0.90688574
0 references
0 references
0.90488684
0 references
0.9046474
0 references
