McCormick, S. T., & Fujishige, S. (2010). Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Mathematical programming, 122(1), 87-120. https://doi.org/10.1007/s10107-008-0242-9
Citace podle Chicago (17th ed.)McCormick, S. Thomas, a Satoru Fujishige. "Strongly Polynomial and Fully Combinatorial Algorithms for Bisubmodular Function Minimization." Mathematical Programming 122, no. 1 (2010): 87-120. https://doi.org/10.1007/s10107-008-0242-9.
Citace podle MLA (9th ed.)McCormick, S. Thomas, a Satoru Fujishige. "Strongly Polynomial and Fully Combinatorial Algorithms for Bisubmodular Function Minimization." Mathematical Programming, vol. 122, no. 1, 2010, pp. 87-120, https://doi.org/10.1007/s10107-008-0242-9.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..