Pages that link to "Item:Q761341"
From MaRDI portal
The following pages link to A polynomial algorithm for minimum quadratic cost flow problems (Q761341):
Displaying 26 items.
- Efficient methods for selfish network design (Q442104) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- Quadratic cost flow and the conjugate gradient method (Q707094) (← links)
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm (Q909582) (← links)
- A fast polynomial time algorithm for logistics network flows (Q924394) (← links)
- New algorithms for convex cost tension problem with application to computer vision (Q1040084) (← links)
- An algorithm for solving quadratic network flow problems (Q1175149) (← links)
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596) (← links)
- Scheduling for electricity cost in a smart grid (Q1702731) (← links)
- Error minimization methods in biproportional apportionment (Q1939088) (← links)
- Optimal deterministic and robust selection of electricity contracts (Q2124812) (← links)
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
- Application of the dual active set algorithm to quadratic network optimization (Q2366828) (← links)
- Preemptive benchmarking problem: An approach for official statistics in small areas (Q2378486) (← links)
- Collusion in atomic splittable routing games (Q2392243) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
- Scheduling for Electricity Cost in Smart Grid (Q2867129) (← links)
- Network flow methods for electoral systems (Q2892147) (← links)
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment (Q2892156) (← links)
- Solving integer minimum cost flows with separable convex cost objective polynomially (Q3716775) (← links)
- Implementing an “exact” Newton method for separable convex transportation problems (Q3827809) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- A proximal subgradient projection algorithm for linearly constrained strictly convex problems (Q5436924) (← links)
- (Q5743452) (← links)
