An exact and heuristic approach for the d-minimum branch vertices problem
DOI10.1007/S10589-018-0027-XzbMATH Open1416.90054OpenAlexW2888462900WikidataQ129363121 ScholiaQ129363121MaRDI QIDQ1756586FDOQ1756586
Authors: Xianqiang Yang 
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
Recommendations
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- Bounded-degree spanning tree problems: models and new algorithms
- A generalization of the minimum branch vertices spanning tree problem
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)
Cites Work
- A simple test on 2-vertex- and 2-edge-connectivity
- Integer Programming Formulation of Traveling Salesman Problems
- 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
- 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
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- Bounded-degree spanning tree problems: models and new algorithms
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
- Efficient algorithms for cluster editing
- A generalization of the minimum branch vertices spanning tree problem
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
Cited In (7)
- Minimizing branching vertices in distance-preserving subgraphs
- The generalized minimum branch vertices problem: properties and polyhedral analysis
- 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
- A generalization of the minimum branch vertices spanning tree problem
- Lower and upper bounds for the spanning tree with minimum branch vertices
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
This page was built for publication: An exact and heuristic approach for the \(d\)-minimum branch vertices problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756586)
