A Lagrangean-based heuristics for the target covering problem in wireless sensor network (Q1788968)
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: A Lagrangean-based heuristics for the target covering problem in wireless sensor network |
scientific article; zbMATH DE number 6949395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lagrangean-based heuristics for the target covering problem in wireless sensor network |
scientific article; zbMATH DE number 6949395 |
Statements
A Lagrangean-based heuristics for the target covering problem in wireless sensor network (English)
0 references
9 October 2018
0 references
sensor scheduling
0 references
maximum set covers
0 references
Lagrangean relaxation
0 references
combinatorial optimization
0 references
0 references
0 references
0 references
0 references
0.809373140335083
0 references
0.807420551776886
0 references
0.8073087334632874
0 references
0.8006130456924438
0 references
