The generalized minimum branch vertices problem: properties and polyhedral analysis
From MaRDI portal
Publication:2031951
DOI10.1007/s10957-020-01783-xzbMath1469.90091OpenAlexW3107634673MaRDI QIDQ2031951
Ciriaco D'Ambrosio, Federica Laureana, Raffaele Cerulli, Francesco Carrabs
Publication date: 15 June 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01783-x
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower and upper bounds for the spanning tree with minimum branch vertices
- An improved hybrid ant-local search algorithm for the partition graph coloring problem
- Routing and wavelength assignment by partition colouring
- 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
- On some applications of the selective graph coloring problem
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- A branch-and-cut algorithm for partition coloring
- Generalized network design polyhedra
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- On the generalized minimum spanning tree problem
- The symmetric generalized traveling salesman polytope
- Spanning Trees with Few Branch Vertices
This page was built for publication: The generalized minimum branch vertices problem: properties and polyhedral analysis
