APA (7th ed.) Citation

Orlin, J. B. (2009). A faster strongly polynomial time algorithm for submodular function minimization. Mathematical programming, 118(2), 237-251. https://doi.org/10.1007/s10107-007-0189-2

Chicago Style (17th ed.) Citation

Orlin, James B. "A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization." Mathematical Programming 118, no. 2 (2009): 237-251. https://doi.org/10.1007/s10107-007-0189-2.

MLA (9th ed.) Citation

Orlin, James B. "A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization." Mathematical Programming, vol. 118, no. 2, 2009, pp. 237-251, https://doi.org/10.1007/s10107-007-0189-2.