Models and heuristics for a minimum arborescence problem
From MaRDI portal
Recommendations
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- Minimum‐weight rooted not‐necessarily‐spanning arborescence problem
- A multiperiod min-sum arborescence problem
- The weighted arborescence constraint
- Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
Cites work
Cited in
(14)- On the complexity of some arborescences finding problems on a multishop radio network
- The p-arborescence star problem: formulations and exact solution approaches
- Solving minimum-cost shared arborescence problems
- The weighted arborescence constraint
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- A multiperiod min-sum arborescence problem
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
- Minimum‐weight rooted not‐necessarily‐spanning arborescence problem
- Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
- Precedence-constrained arborescences
- scientific article; zbMATH DE number 7692724 (Why is no real title available?)
- Vertex covering with capacitated trees
This page was built for publication: Models and heuristics for a minimum arborescence problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5433191)
