Pages that link to "Item:Q5415463"
From MaRDI portal
The following pages link to Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q5415463):
Displaying 14 items.
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
- Market equilibrium under piecewise Leontief concave utilities (Q1676362) (← links)
- Scheduling for electricity cost in a smart grid (Q1702731) (← links)
- Polynomial-time algorithms for submodular Laplacian systems (Q2235770) (← links)
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- Scheduling for Electricity Cost in Smart Grid (Q2867129) (← links)
- A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
- A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities (Q3460332) (← links)
- Solving integer minimum cost flows with separable convex cost objective polynomially (Q3716775) (← links)
- Polyhedral Complementarity on a Simplex. Potentiality of Regular Mappings (Q4553655) (← links)
- Fair Division of Indivisible Goods for a Class of Concave Valuations (Q5094007) (← links)
- A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow (Q5470761) (← links)
