An exact and heuristic approach for the \(d\)-minimum branch vertices problem
From MaRDI portal
Publication:1756586
DOI10.1007/s10589-018-0027-xzbMath1416.90054OpenAlexW2888462900WikidataQ129363121 ScholiaQ129363121MaRDI QIDQ1756586
Publication date: 21 December 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-018-0027-x
Programming involving graphs or networks (90C35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
- Lower and upper bounds for the spanning tree with minimum branch vertices
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- Bounded-degree spanning tree problems: models and new algorithms
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- A generalization of the minimum branch vertices spanning tree problem
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
- A simple test on 2-vertex- and 2-edge-connectivity
- 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
- Integer Programming Formulation of Traveling Salesman Problems
- Efficient algorithms for cluster editing
This page was built for publication: An exact and heuristic approach for the \(d\)-minimum branch vertices problem
