Pages that link to "Item:Q3563015"
From MaRDI portal
The following pages link to Capacitated Confluent Flows: Complexity and Algorithms (Q3563015):
Displaying 11 items.
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- Flow trees for vertex-capacitated networks (Q869579) (← links)
- Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
- Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
- Polynomial-time algorithms for special cases of the maximum confluent flow problem (Q2434729) (← links)
- Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
- Separable convexification and DCA techniques for capacity and flow assignment problems. (Q2773173) (← links)
- Capacity-filtering algorithms for finite-capacity planning of a flexible flow line (Q3055437) (← links)
- (Q4941894) (← links)
- Flows with Unit Path Capacities and Related Packing and Covering Problems (Q5505656) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)