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

DOI10.1016/j.endm.2016.03.038zbMath1351.90051MaRDI 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 algorithm; formulation; tree-star problem

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B10: Deterministic network models in operations research

Uses Software

• TSPLIB