The tree-star problem: a formulation and a branch-and-cut algorithm

DOI10.1016/j.endm.2016.03.038zbMath1351.90051OpenAlexW2408068853MaRDI QIDQ325465

Mohammad Hasan, M. Dambrine

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.038

zbMATH Keywords

branch-and-cut algorithmformulationtree-star problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (1)

Branch‐and‐cut algorithms for the ‐arborescence star problem

Uses Software

• TSPLIB

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
• Reformulations and solution algorithms for the maximum leaf spanning tree problem
• Strong lower bounds for the prize collecting Steiner problem in graphs
• The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
• The Ring Star Problem: Polyhedral analysis and exact algorithm

This page was built for publication: The tree-star problem: a formulation and a branch-and-cut algorithm