Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP (Q4688185): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:58, 7 February 2024
scientific article; zbMATH DE number 6961140
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP |
scientific article; zbMATH DE number 6961140 |
Statements
Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP (English)
0 references
22 October 2018
0 references
prize-collecting Steiner tree problem
0 references
maximum-weight connected subgraph problem
0 references
graph transformations
0 references
dual-ascent heuristics
0 references
