Pages that link to "Item:Q2817799"

The following pages link to A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives (Q2817799):

Displayed 8 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)
• Market exchange models and geometric programming (Q2418159) ‎ (← 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)
• Mean‐standard deviation model for minimum cost flow problem (Q6179689) ‎ (← links)