Pages that link to "Item:Q2464225"
From MaRDI portal
The following pages link to Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths (Q2464225):
Displayed 6 items.
- Integral flow decomposition with minimum longest path length (Q320005) (← links)
- An approximation algorithm for multiroute flow decomposition (Q325487) (← links)
- Mixed integer non-linear programming models for green network design (Q339579) (← links)
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
- Safety and completeness in flow decompositions for RNA assembly (Q2170145) (← links)
- Fast, flexible, and exact minimum flow decompositions via ILP (Q2170151) (← links)