Nemhauser, G. L., & Sigismondi, G. (1992). A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing. The Journal of the Operational Research Society, 43(5), 443-457. https://doi.org/10.1057/jors.1992.71
Citace podle Chicago (17th ed.)Nemhauser, G. L., a G. Sigismondi. "A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing." The Journal of the Operational Research Society 43, no. 5 (1992): 443-457. https://doi.org/10.1057/jors.1992.71.
Citace podle MLA (9th ed.)Nemhauser, G. L., a G. Sigismondi. "A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing." The Journal of the Operational Research Society, vol. 43, no. 5, 1992, pp. 443-457, https://doi.org/10.1057/jors.1992.71.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..