Pages that link to "Item:Q2819530"
From MaRDI portal
The following pages link to A polynomial combinatorial algorithm for generalized minimum cost flow (Q2819530):
Displaying 15 items.
- Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
- A least-squares minimum-cost network flow algorithm (Q646641) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Combinatorial interior point methods for generalized network flow problems (Q1396212) (← links)
- Incremental closure for systems of two variables per inequality (Q1733055) (← links)
- Improving time bounds on maximum generalised flow computations by contracting the network (Q1884873) (← links)
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs (Q3030579) (← links)
- (Q3140457) (← links)
- A Polynomial Algorithm for Weighted Abstract Flow (Q3503842) (← 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)
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137) (← links)
- A cycle augmentation algorithm for minimum cost multicommodity flows on a ring (Q5936466) (← links)
