Cacchiani, V., & D’Ambrosio, C. (2017). A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs. European journal of operational research, 260(3), 920-933. https://doi.org/10.1016/j.ejor.2016.10.015
Citace podle Chicago (17th ed.)Cacchiani, Valentina, a Claudia D’Ambrosio. "A Branch-and-bound Based Heuristic Algorithm for Convex Multi-objective MINLPs." European Journal of Operational Research 260, no. 3 (2017): 920-933. https://doi.org/10.1016/j.ejor.2016.10.015.
Citace podle MLA (9th ed.)Cacchiani, Valentina, a Claudia D’Ambrosio. "A Branch-and-bound Based Heuristic Algorithm for Convex Multi-objective MINLPs." European Journal of Operational Research, vol. 260, no. 3, 2017, pp. 920-933, https://doi.org/10.1016/j.ejor.2016.10.015.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..