Pages that link to "Item:Q6065863"
From MaRDI portal
The following pages link to On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows (Q6065863):
Displaying 9 items.
- On dual minimum cost flow algorithms (Q1396922) (← links)
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
- Complexity and approximability of the maximum flow problem with minimum quantities (Q2811300) (← links)
- (Q2978407) (← links)
- On minimum reload cost paths, tours, and flows (Q3008920) (← links)
- (Q4031619) (← links)
- Interval transportation problem: feasibility, optimality and the worst optimal value (Q6166938) (← links)
- On the complexity of the upgrading version of the maximal covering location problem (Q6541022) (← links)
- Optimizing transient gas network control for challenging real-world instances using MIP-based heuristics (Q6584339) (← links)