Pages that link to "Item:Q909582"

The following pages link to Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm (Q909582):

Displayed 2 items.

• On polynomial solvability of the high multiplicity total weighted tardiness problem (Q1208472) ‎ (← links)
• A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) ‎ (← links)