Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
From MaRDI portal
Publication:1694405
DOI10.1007/S10589-017-9924-7zbMath1394.90547OpenAlexW2736259631MaRDI QIDQ1694405
Mercedes Landete, Alfredo Marín, José Luis Sainz-Pardo
Publication date: 1 February 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9924-7
Related Items (3)
Spanning trees with few branch vertices in graphs of bounded neighborhood diversity ⋮ An exact and heuristic approach for the \(d\)-minimum branch vertices problem ⋮ The generalized minimum branch vertices problem: properties and polyhedral analysis
Uses Software
Cites Work
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
- Looking for edge-equitable spanning trees
- Lower and upper bounds for the spanning tree with minimum branch vertices
- Bounded-degree spanning tree problems: models and new algorithms
- Spanning trees with a bounded number of branch vertices in a claw-free graph
- Tight bounds from a path based formulation for the tree of hub location problem
- Minimal spanning trees with a constraint on the number of leaves
- A branch-and-cut algorithm for the minimum branch vertices spanning tree 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
- On finding spanning trees with few leaves
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
