New branch-and-bound algorithms for k-cardinality tree problems

DOI10.1016/j.endm.2011.05.006zbMath1268.05211OpenAlexW2098904848MaRDI QIDQ2840678

Luidi Simonetti, Yuri Frota, Fábio Protti, Cid Carvalho De Souza

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.006

zbMATH Keywords

combinatorial optimizationbranch and bound method\(k\)-cardinality tree problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Heuristics for the network design problem with connectivity requirements, Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem, On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem

Cites Work

• Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem
• New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
• Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
• Integer Programming Formulations for the k-Cardinality Tree Problem
• Weighted k‐cardinality trees: Complexity and polyhedral structure
• Obtaining optimal k -cardinality trees fast