A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399)
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; zbMATH DE number 6901475
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A relax-and-cut framework for large-scale maximum weight connected subgraph problems |
scientific article; zbMATH DE number 6901475 |
Statements
A relax-and-cut framework for large-scale maximum weight connected subgraph problems (English)
0 references
11 July 2018
0 references
maximum weight connected subgraph problem
0 references
Lagrangian pelaxation
0 references
bioinformatics
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
