A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q126130209, #quickstatements; #temporary_batch_1719508928570 |
||
| (6 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: igraph / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: BioNet / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126130209 / rank | |||
Normal rank | |||
Latest revision as of 19:26, 27 June 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
