Bounded-degree spanning tree problems: models and new algorithms
From MaRDI portal
Publication:632386
DOI10.1007/s10589-007-9120-2zbMath1211.90259MaRDI QIDQ632386
A. Iossa, Raffaele Cerulli, Monica Gentili
Publication date: 24 March 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9120-2
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Spanning Trees with Few Branch Vertices, Spanning trees with few branch vertices in graphs of bounded neighborhood diversity, A genetic approach for the 2‐edge‐connected minimum branch vertices problem, Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem, Lower and upper bounds for the spanning tree with minimum branch vertices, ILP formulation of the degree-constrained minimum spanning hierarchy problem, A branch-and-cut algorithm for the minimum branch vertices spanning tree problem, Decomposition methods based on articulation vertices for degree-dependent spanning tree problems, An exact and heuristic approach for the \(d\)-minimum branch vertices problem, Relations, models and a memetic approach for three degree-dependent spanning tree problems, Approximating spanning trees with few branches, Cutting-plane-based algorithms for two branch vertices related spanning tree problems, An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices, An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
Uses Software
Cites Work
