A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q126130209, #quickstatements; #temporary_batch_1719508928570
Property / Wikidata QID
 
Property / Wikidata QID: Q126130209 / rank
 
Normal rank

Revision as of 18: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
    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

    Identifiers