Pages that link to "Item:Q1079135"
From MaRDI portal
The following pages link to Scaling algorithms for network problems (Q1079135):
Displayed 20 items.
- A scaling technique for finding the weighted analytic center of a polytope (Q687084) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- A linear time algorithm for the maximum capacity path problem (Q809905) (← links)
- The maximum flow problem: A max-preflow approach (Q811325) (← links)
- A parallel algorithm for eliminating cycles in undirected graphs (Q910243) (← links)
- Generating pseudo-random permutations and maximum flow algorithms (Q915489) (← links)
- River routing in VLSI (Q1102106) (← links)
- On graphs preserving rectilinear shortest paths in the presence of obstacles (Q1179762) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
- Computational investigations of maximum flow algorithms (Q1278652) (← links)
- Test sets of integer programs (Q1298753) (← links)
- Lexicographic bottleneck combinatorial problems (Q1306468) (← links)
- Parallel algorithms for the assignment and minimum-cost flow problems (Q1319670) (← links)
- On the exponent of all pairs shortest path problem (Q1356884) (← links)
- A generalization of the scaling max-flow algorithm (Q1885993) (← links)
- A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
- The symbolic algorithms for maximum flow in networks (Q2433386) (← links)
- Minimax inverse problems of minimum cuts (Q2782726) (← links)
- (Q4519920) (← links)