Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems (Q2669540)
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: Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems |
scientific article; zbMATH DE number 7486244
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems |
scientific article; zbMATH DE number 7486244 |
Statements
Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems (English)
0 references
9 March 2022
0 references
target set selection
0 references
integer linear programming
0 references
subgradient method
0 references
Lagrangian relaxation
0 references
dynamic programming
0 references
heuristic solution
0 references
0 references
0 references
0 references
0 references
0.8240048885345459
0 references
0.787808358669281
0 references
0.7755911350250244
0 references
0.7700607180595398
0 references
