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
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SCIP-Jack / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SteinLib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict analysis in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Weight Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rooted Maximum Node-Weight Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral study of the connected subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connected Subgraph Problems in Wildlife Conservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4515163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thinning out Steiner trees: a node-based model for uniform edge costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP-Jack -- a solver for STP and variants with parallelization extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving generalized maximum-weight connected subgraph problem for network enrichment analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust and scalable algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the Steiner problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction tests for the prize-collecting Steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On imposing connectivity constraints in integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:49, 18 July 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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references