A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems (Q102056): Difference between revisions
From MaRDI portal
Removed claim: published in (P200): Item:Q162215 |
Changed an Item |
||
| Property / published in | |||
| Property / published in: Computers \& Operations Research / rank | |||
Normal rank | |||
Latest revision as of 15:17, 14 April 2025
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
