Wahlen, J., & Gschwind, T. (2026). Branch-and-Price for the Set-Union Bin Packing Problem. INFORMS Journal on Computing, 38(3), 844. https://doi.org/10.1287/ijoc.2024.0791
Chicago Style (17th ed.) CitationWahlen, Julia, and Timo Gschwind. "Branch-and-Price for the Set-Union Bin Packing Problem." INFORMS Journal on Computing 38, no. 3 (2026): 844. https://doi.org/10.1287/ijoc.2024.0791.
MLA (9th ed.) CitationWahlen, Julia, and Timo Gschwind. "Branch-and-Price for the Set-Union Bin Packing Problem." INFORMS Journal on Computing, vol. 38, no. 3, 2026, p. 844, https://doi.org/10.1287/ijoc.2024.0791.
Warning: These citations may not always be 100% accurate.