The rooted maximum node-weight connected subgraph problem

DOI10.1007/978-3-642-38171-3_20MaRDI QIDQ4922919zbMATH OpenOpenAlexWikidataFDO

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

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

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

Recommendations

• The Maximum Weight Connected Subgraph Problem
• Solving Connected Subgraph Problems in Wildlife Conservation
• A relax-and-cut framework for large-scale maximum weight connected subgraph problems
• Algorithms for the constrained maximum-weight connected graph problem
• Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph

Cited in

(14)

• A relax-and-cut framework for large-scale maximum weight connected subgraph problems
• A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death
• The generalized reserve set covering problem with connectivity and buffer requirements
• Multicriteria saliency detection: a (exact) robust network design approach
• Mathematical optimization ideas for biodiversity conservation
• The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
• The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
• Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
• Imposing contiguity constraints in political districting models
• The Maximum Weight Connected Subgraph Problem
• Optimal connected subgraphs: Integer programming formulations and polyhedra
• Solving Steiner trees: Recent advances, challenges, and perspectives
• New formulations for two location problems with interconnected facilities
• Vertex covering with capacitated trees

This page was built for publication: The rooted maximum node-weight connected subgraph problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922919)