A comparison of the primal-simplex and primal-dual algorithms for linear programming
From MaRDI portal
Publication:5518974
DOI10.1145/365660.365682zbMath0143.21402OpenAlexW2052971759WikidataQ128523585 ScholiaQ128523585MaRDI QIDQ5518974
Publication date: 1965
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/365660.365682
Related Items (1)
This page was built for publication: A comparison of the primal-simplex and primal-dual algorithms for linear programming