References

Beasley, John E. 1990. “OR-Library: Distributing Test Problems by Electronic Mail.” Journal of the Operational Research Society 41 (11): 1069–72.

Chen, Yuning, and Jin-Kao Hao. 2014. “A ‘Reduce and Solve’ Approach for the Multiple-Choice Multidimensional Knapsack Problem.” European Journal of Operational Research 239 (2): 313–22. https://doi.org/10.1016/j.ejor.2014.05.025.

CVRPLIB. 2014. “CVRPLIB.” http://vrp.galgos.inf.puc-rio.br/index.php/en/.

Dantzig, G., R. Fulkerson, and S. Johnson. 1954. “Solution of a Large-Scale Traveling-Salesman Problem.” Journal of the Operations Research Society of America 2 (4): 393–410. https://doi.org/10.1287/opre.2.4.393.

Dudziński, Krzysztof, and Stanisław Walukiewicz. 1987. “Exact Methods for the Knapsack Problem and Its Generalizations.” European Journal of Operational Research 28 (1): 3–21. https://doi.org/10.1016/0377-2217(87)90165-2.

Kondili, E, CC Pantelides, and R WH Sargent. 1988. “A General Algorithm for Scheduling Batch Operations.” In. Barton, ACT. https://search.informit.org/doi/10.3316/informit.394925233030714.

Ku, Wen-Yang, and J. Christopher Beck. 2016. “Mixed Integer Programming Models for Job Shop Scheduling: A Computational Analysis.” Computers & Operations Research 73 (September): 165–73. https://doi.org/10.1016/j.cor.2016.04.006.

Laporte, Gilbert, Hélène Mercure, and Yves Nobert. 1986. “An Exact Algorithm for the Asymmetrical Capacitated Vehicle Routing Problem.” Networks 16 (1): 33–46. https://doi.org/10.1002/net.3230160104.

Letavec, Craig, and John Ruggiero. 2002. “The n -Queens Problem.” INFORMS Transactions on Education 2 (3): 101–3. https://doi.org/10.1287/ited.2.3.101.

Manne, Alan S. 1960. “On the Job-Shop Scheduling Problem.” Operations Research 8 (2): 219–23. https://doi.org/10.1287/opre.8.2.219.

Miller, C. E., A. W. Tucker, and R. A. Zemlin. 1960. “Integer Programming Formulation of Traveling Salesman Problems.” Journal of the ACM 7 (4): 326–29. https://doi.org/10.1145/321043.321046.

Petersen, Clifford C. 1967. “Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects.” Management Science 13 (9): 736–50. https://doi.org/10.1287/mnsc.13.9.736.

Sinha, Prabhakant, and Andris A. Zoltners. 1979. “The Multiple-Choice Knapsack Problem.” Operations Research 27 (3): 503–15. https://www.jstor.org/stable/170213.

Toth, Paolo, and Daniele Vigo. 2014. Vehicle Routing: Problems, Methods, and Applications. SIAM.

Wagner, Harvey M. 1959. “An Integer Linear-Programming Model for Machine Scheduling.” Naval Research Logistics Quarterly 6 (2): 131–40. https://doi.org/10.1002/nav.3800060205.