The following pages link to Finding optimum branchings (Q4158841):
Displaying 13 items.
- A multiperiod min-sum arborescence problem (Q260662) (← links)
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Asymptotic behavior of eigenvalues and random updating schemes (Q688863) (← links)
- Approximate maximum weight branchings (Q845674) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- Learning extended tree augmented naive structures (Q895526) (← links)
- Inferring (biological) signal transduction networks via transitive reductions of directed graphs (Q930591) (← links)
- A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779) (← links)
- Coordination problems on networks revisited: statics and dynamics (Q5860332) (← links)
- Algorithm for sequential construction of spanning minimal directed forests (Q6147861) (← links)
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)
