Modeling and solving the angular constrained minimum spanning tree problem

DOI10.1016/j.cor.2019.104775zbMath1458.90623OpenAlexW2969918324WikidataQ127340541 ScholiaQ127340541MaRDI QIDQ2329732

Yanyan Li

Publication date: 18 October 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.104775

zbMATH Keywords

combinatorial optimizationpolyhedral combinatoricsbranch-and-cut algorithmsangular constrained spanning trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem ⋮ A unifying model for locally constrained spanning tree problems

Uses Software

• TSPLIB
• XPRESS

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Bounded-angle spanning tree: modeling networks with angular constraints
• Connectivity guarantees for wireless networks with directional antennas
• Ice-creams and wedge graphs
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Trees and Cuts
• TSPLIB—A Traveling Salesman Problem Library
• Matroids and the greedy algorithm
• Benchmarking optimization software with performance profiles.

This page was built for publication: Modeling and solving the angular constrained minimum spanning tree problem