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 |
Normalize DOI. |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.4208/jcm.1709-m2017-0002 / rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SCIP-Jack / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SCIP / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2481380102 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129876049 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.4208/JCM.1709-M2017-0002 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:05, 30 December 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
