Pages that link to "Item:Q3783057"
From MaRDI portal
The following pages link to A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM (Q3783057):
Displaying 9 items.
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485) (← links)
- A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
- On dual minimum cost flow algorithms (Q1396922) (← links)
- A Simple Efficient Interior Point Method for Min-Cost Flow (Q2942676) (← links)
- Solving integer minimum cost flows with separable convex cost objective polynomially (Q3716775) (← links)
- (Q4031619) (← links)
- New polynomial-time cycle-canceling algorithms for minimum-cost flows (Q4509383) (← links)
- (Q5171710) (← links)
- (Q5420919) (← links)