Robb, D. J., & Trietsch, D. (1999). Maximizing the number of mixed packages subject to variety constraints. Computers & operations research, 26(13), 1323-1333. https://doi.org/10.1016/S0305-0548(98)00105-1
Citácia podle Chicago (17th ed.)Robb, David J., a Dan Trietsch. "Maximizing the Number of Mixed Packages Subject to Variety Constraints." Computers & Operations Research 26, no. 13 (1999): 1323-1333. https://doi.org/10.1016/S0305-0548(98)00105-1.
Citácia podľa MLA (8th ed.)Robb, David J., a Dan Trietsch. "Maximizing the Number of Mixed Packages Subject to Variety Constraints." Computers & Operations Research, vol. 26, no. 13, 1999, pp. 1323-1333, https://doi.org/10.1016/S0305-0548(98)00105-1.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..