Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080)
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: Exact algorithms for budgeted prize-collecting covering subgraph problems |
scientific article; zbMATH DE number 7546541
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact algorithms for budgeted prize-collecting covering subgraph problems |
scientific article; zbMATH DE number 7546541 |
Statements
Exact algorithms for budgeted prize-collecting covering subgraph problems (English)
0 references
22 June 2022
0 references
prize-collecting problems
0 references
budget
0 references
covering problems
0 references
branch-and-cut
0 references
Benders decomposition
0 references
symmetry breaking
0 references
0 references
0 references
0 references
0 references
0 references
0 references
