Two dependency constrained spanning tree problems

DOI10.1111/itor.12690OpenAlexW2950104153MaRDI QIDQ6067892

Luiz Alberto do Carmo Viana, Manoel B. Campêlo

Publication date: 17 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12690

zbMATH Keywords

computational complexityinapproximabilitydependency constrained spanning tree

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

Precedence-constrained arborescences ⋮ A unifying model for locally constrained spanning tree problems

Cites Work

• Unnamed Item
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
• The minimum spanning tree problem with conflict constraints and its variations
• Paths, trees and matchings under disjunctive constraints
• On star and caterpillar arboricity
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• A branch and cut algorithm for minimum spanning trees under conflict constraints
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
• Integer Programming Formulation of Traveling Salesman Problems
• Analytical approach to parallel repetition

This page was built for publication: Two dependency constrained spanning tree problems