The following pages link to (Q3840370):
Displayed 8 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)
- A penalty function heuristic for the resource constrained shortest path problem (Q1848355) (← links)
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (Q2642898) (← links)
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory (Q5693011) (← links)