A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
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 | |||
Revision as of 14:19, 8 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
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
