The following pages link to (Q3236245):
Displaying 11 items.
- A primal-dual simplex method for linear programs (Q688212) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Local ratio with negative weights. (Q703278) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- Penelope's graph: a hard minimum cost tension instance (Q1127551) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- An efficient P-D algorithm for shortest path problem (Q1367256) (← links)
- A parallel primal-dual simplex algorithm (Q1591540) (← links)
- Dynamic algorithms via the primal-dual method (Q1640995) (← links)
- Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple (Q6116659) (← links)
