A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems (Q102056): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126130209, #quickstatements; #temporary_batch_1723800143925 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2017.05.015 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2017.05.015 / rank | |||
Normal rank | |||
Latest revision as of 08:49, 31 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems |
scientific article |
Statements
87
0 references
63-82
0 references
November 2017
0 references
