A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2017.05.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2618313358 / rank | |||
Normal rank | |||
Revision as of 02:44, 20 March 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
