A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: igraph / rank | |||
Normal rank | |||
Revision as of 01:29, 28 February 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
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
