Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 14:41, 7 February 2024

scientific article; zbMATH DE number 7017815
Language Label Description Also known as
English
Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem
scientific article; zbMATH DE number 7017815

    Statements

    Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (English)
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    combinatorial optimization
    0 references
    maximum-weight connected subgraph problem
    0 references
    reduction techniques
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references