Stop the war!
Остановите войну!
for scientists:
default search action
"A strongly polynomial algorithm for minimum convex separable quadratic ..."
Arie Tamir (1993)
- Arie Tamir:
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks. Math. Program. 59: 117-132 (1993)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.