A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
DOI10.1016/J.COR.2016.11.010zbMATH Open1391.90619DBLPjournals/cor/SilvestriLC17OpenAlexW2550142813WikidataQ56524258 ScholiaQ56524258MaRDI QIDQ1652257FDOQ1652257
Raffaele Cerulli, Selene Silvestri, G. Laporte
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.11.010
Recommendations
- A branch and cut method for the degree-constrained minimum spanning tree problem
- A generalization of the minimum branch vertices spanning tree problem
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- A branch and bound algorithm for the capacitated minimum spanning tree problem
- A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
- scientific article; zbMATH DE number 2090612
- A branch-and-bound algorithm for the mini-max spanning forest problem
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A simple test on 2-vertex- and 2-edge-connectivity
- Integer Programming Formulation of Traveling Salesman Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- Trees and Cuts
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
- 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
- Title not available (Why is that?)
- Bounded-degree spanning tree problems: models and new algorithms
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
- Integer Programming
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
Cited In (14)
- A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
- Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
- A branch and bound algorithm for the capacitated minimum spanning tree problem
- An exact and heuristic approach for the \(d\)-minimum branch vertices problem
- The generalized minimum branch vertices problem: properties and polyhedral analysis
- A genetic approach for the 2‐edge‐connected minimum branch vertices problem
- Title not available (Why is that?)
- Spanning Trees with Few Branch Vertices
- Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem
- Improved approaches to solve the one-to-one skewgram problem
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
This page was built for publication: A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652257)
