Stop the war!
Остановите войну!
for scientists:
default search action
"On strongly polynomial variants of the network simplex algorithm for the ..."
Donald Goldfarb, Jianxiu Hao (1991)
- Donald Goldfarb, Jianxiu Hao:
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem. Oper. Res. Lett. 10(7): 383-387 (1991)
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.