Rustem, B., Akrotirianakis, I., & Maros, I. (2001). An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems. Optimization methods & software, 16(1-4), 21-47. https://doi.org/10.1080/10556780108805827
Citace podle Chicago (17th ed.)Rustem, Berc, Ioannis Akrotirianakis, a Istvan Maros. "An Outer Approximation Based Branch and Cut Algorithm for Convex 0-1 MINLP Problems." Optimization Methods & Software 16, no. 1-4 (2001): 21-47. https://doi.org/10.1080/10556780108805827.
Citace podle MLA (9th ed.)Rustem, Berc, et al. "An Outer Approximation Based Branch and Cut Algorithm for Convex 0-1 MINLP Problems." Optimization Methods & Software, vol. 16, no. 1-4, 2001, pp. 21-47, https://doi.org/10.1080/10556780108805827.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..