Pages that link to "Item:Q3202103"
From MaRDI portal
The following pages link to A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS (Q3202103):
Displaying 10 items.
- A combinatorial interior point method for network flow problems (Q1196185) (← links)
- Combinatorial interior point methods for generalized network flow problems (Q1396212) (← links)
- Exploiting special structure in a primal-dual path-following algorithm (Q1803615) (← links)
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
- Determination of optimal vertices from feasible solutions in unimodular linear programming (Q2366606) (← links)
- A Simple Efficient Interior Point Method for Min-Cost Flow (Q2942676) (← links)
- POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS (Q3204329) (← links)
- Solving integer minimum cost flows with separable convex cost objective polynomially (Q3716775) (← links)
- New polynomial-time cycle-canceling algorithms for minimum-cost flows (Q4509383) (← links)
- (Q5171710) (← links)