Pages that link to "Item:Q2817799"
From MaRDI portal
The following pages link to A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799):
Displaying 12 items.
- Complexity of linear minimization and projection on some sets (Q2060605) (← links)
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) (← links)
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence (Q2149565) (← links)
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
- Market exchange models and geometric programming (Q2418159) (← links)
- Solving integer minimum cost flows with separable convex cost objective polynomially (Q3716775) (← links)
- Ascending-Price Algorithms for Unknown Markets (Q4972683) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential (Q5216797) (← links)
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q5415463) (← links)
- A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow (Q5470761) (← links)
- Mean‐standard deviation model for minimum cost flow problem (Q6179689) (← links)
