参考文献

Achterberg, Tobias. 2007. “Constraint Integer Programming.” PhD thesis, Technische Universität Berlin.

Achterberg, Tobias, Thorsten Koch, and Alexander Martin. 2005. “Branching Rules Revisited.” Oper. Res. Lett. 33 (1): 42–54.

Arrow, Kenneth J, Theodore Harris, and Jacob Marschak. 1951. “Optimal Inventory Policy.” Econometrica 19 (3): 250.

Benichou, M, J M Gauthier, P Girodet, G Hentges, G Ribiere, and O Vincent. 1971. “Experiments in Mixed-Integer Linear Programming.” Math. Program. 1 (1): 76–94.

Bertsekas, Dimitri, and John N Tsitsiklis. 2008. Introduction to Probability. Athena Scientific.

Brunelli, Matteo. 2015. Introduction to the Analytic Hierarchy Process. 2015th ed. SpringerBriefs in Operations Research. Springer International Publishing.

Camm, Jeffrey, James Cochran, Michael Fry, et al. 2022. An Introduction to Management Science: Quantitative Approaches to Decision Making. 16th ed. South-Western College Publishing.

Charnes, A, W W Cooper, and E Rhodes. 1978. “Measuring the Efficiency of Decision Making Units.” Eur. J. Oper. Res. 2 (6): 429–44.

Cooper, William W, Lawrence M Seiford, and Kaoru Tone. 2007. Data Envelopment Analysis: A Comprehensive Text with Models, Applications, References and DEA-Solver Software. 2nd ed. Springer.

Cooper, William W, Lawrence M Seiford, and Joe Zhu, eds. 2011. Handbook on Data Envelopment Analysis. 2nd ed. Springer.

Crawford, Gordon, and Cindy Williams. 1985. “A Note on the Analysis of Subjective Judgment Matrices.” Journal of Mathematical Psychology, Some thoughts about the mathematics of the analytic hierarchy process, vol. 29 (4): 387–405. https://doi.org/10.1016/0022-2496(85)90002-1.

Deb, Kalyanmoy. 2000. “An Efficient Constraint Handling Method for Genetic Algorithms.” Comput. Methods Appl. Mech. Eng. 186 (2-4): 311–38.

Eiselt, H A, and Carl-Louis Sandblom. 2022. Operations Research: A Model-Based Approach. Springer International Publishing.

Fox, B L, J K Lenstra, A H G Rinnooy Kan, and L E Schrage. 1978. “Branching from the Largest Upper Bound: Folklore and Facts.” Eur. J. Oper. Res. 2 (3): 191–94.

Harris, Ford W. 1990. “How Many Parts to Make at Once.” Oper. Res. 38 (6): 947–50.

Hillier, Frederick, and Gerald Lieberman. 2025. ISE Introduction to Operations Research. 11th ed. McGraw-Hill Education.

Huber, Jakob, Sebastian Müller, Moritz Fleischmann, and Heiner Stuckenschmidt. 2019. “A Data-Driven Newsvendor Problem: From Data to Decision.” Eur. J. Oper. Res. 278 (3): 904–15.

Kochenderfer, Mykel J, and Tim A Wheeler. 2019. Algorithms for Optimization. MIT Press.

Linderoth, J T, and M W P Savelsbergh. 1999. “A Computational Study of Search Strategies for Mixed Integer Programming.” INFORMS J. Comput. 11 (2): 173–87.

Little, John D C. 1961. “A Proof for the Queuing Formula: L = λw.” Oper. Res. 9 (3): 383–87.

Lodi, Andrea, and Giulia Zarpellon. 2017. “On Learning and Branching: A Survey.” TOP 25 (2): 207–36.

Morrison, David R, Sheldon H Jacobson, Jason J Sauppe, and Edward C Sewell. 2016. “Branch-and-Bound Algorithms: A Survey of Recent Advances in Searching, Branching, and Pruning.” Discrete Optim. 19 (February): 79–102.

Pleguezuelo, Rafael Herrerı́as, José Garcı́a Pérez, and Salvador Cruz Rambaud. 2003. “A Note on the Reasonableness of PERT Hypotheses.” Oper. Res. Lett. 31 (1): 60–62.

Qin, Yan, Ruoxuan Wang, Asoo J Vakharia, Yuwen Chen, and Michelle M H Seref. 2011. “The Newsvendor Problem: Review and Directions for Future Research.” Eur. J. Oper. Res. 213 (2): 361–74.

Saaty, T. 2008. “Decision Making with the Analytic Hierarchy Process.” International Journal of Services Sciences 1 (1): 83–98. https://doi.org/10.1504/IJSSCI.2008.017590.

Saaty, Thomas L. 1977. “A Scaling Method for Priorities in Hierarchical Structures.” J. Math. Psychol. 15 (3): 234–81.

Scarf, Herbert. 1959. The Optimality of (S, s) Policies in the Dynamic Inventory Problem.

Scavuzzo, Lara, Karen Aardal, Andrea Lodi, and Neil Yorke-Smith. 2024. “Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming.” Math. Program. 217 (1-2): 123–66.

Shortle, John F, James M Thompson, Donald Gross, and Carl M Harris. 2018. Fundamentals of Queueing Theory. Wiley Series in Probability and Statistics. John Wiley & Sons.

Snyder, Lawrence V, and Zuo-Jun Max Shen. 2019. Fundamentals of Supply Chain Theory. 2nd ed. John Wiley & Sons.

Stidham, Shaler, Jr. 1974. “Technical Note—a Last Word on l = λw.” Oper. Res. 22 (2): 417–21.