Pages that link to "Item:Q909582"
From MaRDI portal
The following pages link to Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm (Q909582):
Displaying 10 items.
- On a quadratic programming problem involving distances in trees (Q338937) (← links)
- On polynomial solvability of the high multiplicity total weighted tardiness problem (Q1208472) (← links)
- A primal-simplex based Tardos' algorithm (Q1785451) (← links)
- A note on the strong polynomiality of convex quadratic programming (Q1804355) (← links)
- On solving a non-convex quadratic programming problem involving resistance distances in graphs (Q2177791) (← links)
- On simultaneous approximation in quadratic integer programming (Q2314408) (← links)
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
- The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption (Q2829586) (← links)
- Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables (Q6161304) (← links)
