A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks

From MaRDI portal
Publication:2366611

DOI10.1007/BF01581240zbMath0795.90021MaRDI QIDQ2366611

Arie Tamir

Publication date: 30 August 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)




Related Items



Cites Work