An exact algorithm for the maximal covering problem (Q4883162): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
An exact algorithm for the maximal covering problem | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199604)43:3<435::aid-nav8>3.0.co;2-a / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081384553 / rank | |||
Normal rank | |||
| Property / title | |||
An exact algorithm for the maximal covering problem (English) | |||
| Property / title: An exact algorithm for the maximal covering problem (English) / rank | |||
Normal rank | |||
Latest revision as of 10:06, 30 July 2024
scientific article; zbMATH DE number 895005
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
