Pages that link to "Item:Q789313"
From MaRDI portal
The following pages link to A parametric algorithm for convex cost network flow and related problems (Q789313):
Displaying 12 items.
- Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs (Q1317479) (← links)
- A parametric approach for maximum flow problems with an additional reverse convex constraint (Q1357785) (← links)
- On a new class of bilevel programming problems and its use for reformulating mixed integer problems (Q1388924) (← links)
- Approximation of convex curves with application to the bicriterial minimum cost flow problem (Q1825606) (← links)
- An integer fuzzy transportation problem (Q1921223) (← links)
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems (Q2468881) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315) (← links)
- Solving the Convex Cost Integer Dual Network Flow Problem (Q3114859) (← links)
- A hybrid algorithm for solving convex separable network flow problems (Q3706799) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)