A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems (Q102056)
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: A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems |
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
