Two dependency constrained spanning tree problems

DOI10.1111/ITOR.12690MaRDI QIDQ6067892zbMATH OpenOpenAlexFDO

Authors Luiz Alberto do Carmo Viana, Manoel 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)

Cites work

• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• A branch and cut algorithm for minimum spanning trees under conflict constraints
• Analytical approach to parallel repetition
• Integer Programming Formulation of Traveling Salesman Problems
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
• On star and caterpillar arboricity
• Paths, trees and matchings under disjunctive constraints
• The minimum spanning tree problem with conflict constraints and its variations
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints

Cited in

(4)

• On the 2-MRS problem in a tree with unreliable edges
• Precedence-constrained arborescences
• A unifying model for locally constrained spanning tree problems
• The 2-hop spanning tree problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6067892)