The following pages link to (Q3840370):
Displaying 15 items.
- A combinatorial approximation algorithm for concurrent flow problem and its application (Q707017) (← links)
- A combinatorial approximation algorithm for supply chain network flow problem (Q884620) (← links)
- A fast polynomial time algorithm for logistics network flows (Q924394) (← links)
- Hypermatrix oriented supernode amalgamation (Q1009360) (← links)
- On some difficult linear programs coming from set partitioning (Q1348247) (← links)
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422) (← links)
- A penalty function heuristic for the resource constrained shortest path problem (Q1848355) (← links)
- A multicommodity network flow application for the capacitated minimal spanning tree problem (Q1890671) (← links)
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (Q2642898) (← links)
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems (Q4427382) (← links)
- (Q5020878) (← links)
- Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size (Q5171158) (← links)
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory (Q5693011) (← links)
- Approximation and Online Algorithms (Q5896938) (← links)
