The Rooted Maximum Node-Weight Connected Subgraph Problem

DOI10.1007/978-3-642-38171-3_20zbMath1382.90108OpenAlexW2191287888WikidataQ56977053 ScholiaQ56977053MaRDI QIDQ4922919

Petra Mutzel, Eduardo Álvarez-Miranda, Ivana Ljubić

Publication date: 4 June 2013

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38171-3_20

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Connectivity (05C40) Signed and weighted graphs (05C22)

Related Items (11)

The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences ⋮ A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ Imposing Contiguity Constraints in Political Districting Models ⋮ Multicriteria saliency detection: a (exact) robust network design approach ⋮ Optimal connected subgraphs: Integer programming formulations and polyhedra ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Vertex covering with capacitated trees ⋮ A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death ⋮ Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem ⋮ The generalized reserve set covering problem with connectivity and buffer requirements ⋮ Mathematical optimization ideas for biodiversity conservation

This page was built for publication: The Rooted Maximum Node-Weight Connected Subgraph Problem