Pages that link to "Item:Q1317479"
From MaRDI portal
The following pages link to Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs (Q1317479):
Displaying 15 items.
- A parametric algorithm for convex cost network flow and related problems (Q789313) (← links)
- Network optimization with piecewise linear convex costs (Q971452) (← links)
- Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
- Approximation of convex curves with application to the bicriterial minimum cost flow problem (Q1825606) (← links)
- A linear time approximation algorithm for movement minimization in conveyor flow shop processing (Q1887913) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315) (← links)
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
- A Simple Efficient Interior Point Method for Min-Cost Flow (Q2942676) (← links)
- Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications (Q3098331) (← links)
- (Q3486356) (← links)
- Solving integer minimum cost flows with separable convex cost objective polynomially (Q3716775) (← links)
- Flot à coût convexe linéaire par morceaux (Q3762038) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- Robust Appointment Scheduling with Heterogeneous Costs (Q5875477) (← links)
