Multiobjective Combinatorial Optimization: Foundations, Theory, and Methods

References

• [1] M. Abbas, M. E. A. Chergui, and M. A. Mehdi. Efficient cuts for generating the non-dominated vectors for multiple objective integer linear programming. International Journal of Mathematics in Operational Research 4(3):302–316, 2012.Crossref, Google Scholar
• [2] B. Afsar, K. Miettinen, and F. Ruiz. Assessing the performance of interactive multiobjective optimization methods: A survey. ACM Computing Surveys 54(4):1–27, 2021.Crossref, Google Scholar
• [3] R. Allmendinger, A. Jaszkiewicz, A. Liefooghe, and C. Tammer. What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization. Computers & Operations Research 145:105857, 2022.Crossref, Google Scholar
• [4] M. J. Alves and J. Clímaco. An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound. European Journal of Operational Research 124(3):478–494, 2000.Crossref, Google Scholar
• [5] M. J. Alves and J. Clímaco. A review of interactive methods for multiobjective integer and mixed-integer programming. European Journal of Operational Research 180(1):99–115, 2007.Crossref, Google Scholar
• [6] Y. P. Aneja and K. P. Nair. Bicriteria transportation problem. Management Science 25(1):73–78, 1979.Link, Google Scholar
• [7] M. Barbati, S. Corrente, and S. Greco. Multiobjective combinatorial optimization with interactive evolutionary algorithms: The case of facility location problems. EURO Journal on Decision Processes 12:100047, 2024.Crossref, Google Scholar
• [8] C. Bazgan, H. Hugot, and D. Vanderpooten. Solving efficiently the 0–1 multi-objective knapsack problem. Computers & Operations Research 36(1):260–279, 2009.Crossref, Google Scholar
• [9] C. Bazgan, F. Jamain, and D. Vanderpooten. Discrete representation of the non-dominated set for multi-objective optimization problems using kernels. European Journal of Operational Research 260(3):814–827, 2017.Crossref, Google Scholar
• [10] T. Bektaş. Disjunctive programming for multiobjective discrete optimisation. INFORMS Journal on Computing 30(4):625–633, 2018.Link, Google Scholar
• [11] V. Belton, J. Branke, P. Eskelinen, S. Greco, J. Molina, F. Ruiz, and R. Słowiński. Interactive Multiobjective Optimization from a Learning Perspective. Springer, Berlin, 2008.Crossref, Google Scholar
• [12] N. Boland, H. Charkhgard, and M. Savelsbergh. The L-shape search method for triobjective integer programming. Mathematical Programming Computation 8:217–251, 2016.Crossref, Google Scholar
• [13] N. Boland, H. Charkhgard, and M. Savelsbergh. A new method for optimizing a linear function over the efficient set of a multiobjective integer program. European Journal of Operational Research 260(3):904–919, 2017.Crossref, Google Scholar
• [14] N. Boland, H. Charkhgard, and M. Savelsbergh. The quadrant shrinking method: A simple and efficient algorithm for solving tri-objective integer programs. European Journal of Operational Research 260(3):873–885, 2017.Crossref, Google Scholar
• [15] N. Boland, H. Charkhgard, and M. Savelsbergh. Preprocessing and cut generation techniques for multi-objective binary programming. European Journal of Operational Research 274(3):858–875, 2019.Crossref, Google Scholar
• [16] V. J. Bowman. On the relationship of the tchebycheff norm and the efficient frontier of multiple-criteria objectives. H. Thiriez and S. Zionts, editors. Multiple Criteria Decision Making. Springer, Berlin, 76–86, 1976.Crossref, Google Scholar
• [17] J. Brans, P. Vincke, and B. Mareschal. How to select and how to rank projects: The Promethee method. European Journal of Operational Research 24(2):228–238, 1986.Crossref, Google Scholar
• [18] G. Ceyhan, M. Köksalan, and B. Lokman. Finding a representative nondominated set for multi-objective mixed integer programs. European Journal of Operational Research 272(1):61–77, 2019.Crossref, Google Scholar
• [19] A. Charnes and W. Cooper. Goal programming and multiple objective optimizations: Part 1. European Journal of Operational Research 1(1):39–54, 1977.Crossref, Google Scholar
• [20] J. Chen, Z. Zhang, Z. Cao, Y. Wu, Y. Ma, T. Ye, and J. Wang. Neural multi-objective combinatorial optimization with diversity enhancement. A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine, editors. Advances in Neural Information Processing Systems, volume 36. Curran Associates, Inc., Red Hook, New York, 39176–39188, 2023.Google Scholar
• [21] C. A. Coello Coello, C. Dhaenens, and L. Jourdan. Multi-Objective Combinatorial Optimization: Problematic and Context. Springer, Berlin, 2010.Google Scholar
• [22] M. J. Connor, M. A. Gorin, D. Eldred-Evans, E. J. Bass, A. Desai, T. Dudderidge, M. Winkler, et al. Landmarks in the evolution of prostate biopsy. Nature Reviews Urology 20(4):241–258, 2023.Crossref, Google Scholar
• [23] H. W. Corley and I. D. Moon. Shortest paths in networks with vector weights. Journal of Optimization Theory and Applications 46(1):79–86, 1985.Crossref, Google Scholar
• [24] S. Corrente, S. Greco, B. Matarazzo, and R. Słowiński. Explainable interactive evolutionary multiobjective optimization. Omega 122:102925, 2024.Crossref, Google Scholar
• [25] R. L. Crouch. Human Behavior: An Economic Approach. Duxbury Press, North Scituate, MA, 1979.Google Scholar
• [26] K. Dächert and K. Klamroth. A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems. Journal of Global Optimization 61:643–676, 2015.Crossref, Google Scholar
• [27] K. Dächert, T. Fleuren, and K. Klamroth. A simple, efficient and versatile objective space algorithm for multiobjective integer programming. Mathematical Methods of Operations Research 100(1):351–384, 2024.Crossref, Google Scholar
• [28] K. Dächert, K. Klamroth, R. Lacour, and D. Vanderpooten. Efficient computation of the search region in multi-objective optimization. European Journal of Operational Research 260(3):841–855, 2017.Crossref, Google Scholar
• [29] K. Deb. Multi-Objective Optimization Using Evolutionary Algorithms, John Wiley & Sons, New York, 2001.Google Scholar
• [30] K. Deb. Multi-objective evolutionary algorithms. J. Kacprzyk and W. Pedrycz, editors. Springer Handbook of Computational Intelligence. Springer, Berlin, Heidelberg, 995–1015, 2015.Crossref, Google Scholar
• [31] K. Deb, A. Pratap, S. Agarwal, and T. A. M. T. Meyarivan. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2):182–197, 2002.Crossref, Google Scholar
• [32] A. Dehnokhalaji, P. J. Korhonen, M. Köksalan, N. Nasrabadi, and J. Wallenius. Convex cone-based partial order for multiple criteria alternatives. Decision Support Systems 51(2):256–261, 2011.Crossref, Google Scholar
• [33] I. Doğan, B. Lokman, and M. Köksalan. Representing the nondominated set in multi-objective mixed-integer programs. European Journal of Operational Research 296(3):804–818, 2022.Crossref, Google Scholar
• [34] M. Domínguez-Ríos, F. Chicano, and E. Alba. Effective anytime algorithm for multiobjective combinatorial optimization problems. Information Sciences 565:210–228, 2021.Crossref, Google Scholar
• [35] M. Ehrgott. Approximation algorithms for combinatorial multicriteria optimization problems. International Transactions in Operational Research 7(1):5–31, 2000.Crossref, Google Scholar
• [36] M. Ehrgott. Hard to say it’s easy—Four reasons why combinatorial multiobjective programmes are hard. Y. Y. Haimes and R. E. Steuer, editors. Research and Practice in Multiple Criteria Decision Making. Springer, Berlin, 69–80, 2000.Crossref, Google Scholar
• [37] M. Ehrgott. Multicriteria Optimization, volume 491. Springer Science & Business Media, Boston, 2005.Google Scholar
• [38] M. Ehrgott and X. Gandibleux. A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum 22:425–460, 2000.Crossref, Google Scholar
• [39] M. Ehrgott and X. Gandibleux. Approximative solution methods for multiobjective combinatorial optimization. Transactions in Operations Research, An Official Journal of the Spanish Society of Statistics and Operations Research 12(1):1–63, 2004.Google Scholar
• [40] M. Ehrgott and K. Klamroth. Connectedness of efficient solutions in multiple criteria combinatorial optimization. European Journal of Operational Research 97(1):159–166, 1997.Crossref, Google Scholar
• [41] M. Ehrgott, X. Gandibleux, and A. Przybylski. Exact methods for multi-objective combinatorial optimisation. S. Greco, M. Ehrgott, and J. Figueira, editors. Multiple Criteria Decision Analysis: State of the Art Surveys. International Series in Operations Research & Management Science, volume 233. Springer, New York, 817–850, 2016.Crossref, Google Scholar
• [42] M. Ehrgott, M. Köksalan, M. Kadziński, and K. Deb. Fifty years of multi-objective optimization and decision-making: From mathematical programming to evolutionary computation. European Journal of Operational Research 330(1):1–25, 2026.Crossref, Google Scholar
• [43] T. Erlebach, H. Kellerer, and U. Pferschy. Approximating multiobjective knapsack problems. Management Science 48(12):1603–1612, 2002.Link, Google Scholar
• [44] European Association of Urology. EAU guidelines on prostate cancer: Diagnostic evaluation. Accessed May 10, 2026, https://uroweb.org/guidelines/prostate-cancer/chapter/diagnostic-evaluation, 2026.Google Scholar
• [45] A. Eusébio, J. R. Figueira, and M. Ehrgott. On finding representative non-dominated points for bi-objective integer network flow problems. Computers & Operations Research 48:1–10, 2014.Crossref, Google Scholar
• [46] S. L. Faulkenberg and M. M. Wiecek. On the quality of discrete representations in multiple objective programming. Optimization and Engineering 11(3):423–440, 2010.Crossref, Google Scholar
• [47] J. R. Figueira, K. Klamroth, M. Stiglmayr, and J. Sudhoff Santos. On the computational complexity of ordinal multi-objective unconstrained combinatorial optimization. Operations Research Letters 61:107302, 2025.Crossref, Google Scholar
• [48] J. W. Fowler, E. S. Gel, M. M. Köksalan, P. Korhonen, J. L. Marquis, and J. Wallenius. Interactive evolutionary multi-objective optimization for quasi-concave preference functions. European Journal of Operational Research 206(2):417–425, 2010.Crossref, Google Scholar
• [49] S. French. Interactive multi-objective programming: Its aims, applications and demands. Journal of the Operational Research Society 35(9):827–834, 1984.Crossref, Google Scholar
• [50] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.Google Scholar
• [51] A. M. Geoffrion. Proper efficiency and the theory of vector maximization. Journal of Mathematical Analysis and Applications 22(3):618–630, 1968.Crossref, Google Scholar
• [52] A. M. Geoffrion, J. S. Dyer, and A. Feinberg. An interactive approach for multi-criterion optimization, with an application to the operation of an academic department. Management Science 19(4-part-1):357–368, 1972.Link, Google Scholar
• [53] J. Guddat, F. G. Vasquesz, K. Tammer, and K. Wendler. Multiobjective and Stochastic Optimization Based on Parametric Optimization. Akademie-Verlag, Berlin, 1985.Google Scholar
• [54] Y. Haimes. On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Transactions on Systems, Man, and Cybernetics 3:296–297, 1971.Google Scholar
• [55] P. Halffmann, L. E. Schäfer, K. Dächert, K. Klamroth, and S. Ruzika. Exact algorithms for multiobjective linear optimization problems with integer variables: A state of the art survey. Journal of Multi-Criteria Decision Analysis 29(5–6):341–363, 2022.Crossref, Google Scholar
• [56] H. W. Hamacher and G. Ruhe. On spanning tree problems with multiple objectives. Annals of Operations Research 52(4):209–230, 1994.Crossref, Google Scholar
• [57] H. W. Hamacher, C. R. Pedersen, and S. Ruzika. Finding representative systems for discrete bicriterion optimization problems. Operations Research Letters 35(3):336–344, 2007.Crossref, Google Scholar
• [58] A. Herzel, S. Ruzika, and C. Thielen. Approximation methods for multiobjective optimization problems: A survey. INFORMS Journal on Computing 33(4):1284–1299, 2021.Abstract, Google Scholar
• [59] D. Jones and M. Tamiz. A Review of Goal Programming. Springer, New York, 2016.Crossref, Google Scholar
• [60] J. M. Juran, F. M. Gryna, and R. S. Bingham. Quality Control Handbook, volume 3. McGraw-Hill, New York, 1979.Google Scholar
• [61] J. Karaivanova, P. Korhonen, S. Narula, J. Wallenius, and V. Vassilev. A reference direction approach to multiple objective integer linear programming. European Journal of Operational Research 81(1):176–187, 1995.Crossref, Google Scholar
• [62] M. P. Kidd, R. Lusby, and J. Larsen. Equidistant representations: Connecting coverage and uniformity in discrete biobjective optimization. Computers & Operations Research 117:104872, 2020.Crossref, Google Scholar
• [63] G. Kirlik and S. Sayın. Computing the nadir point for multiobjective discrete optimization problems. Journal of Global Optimization 62(1):79–99, 2015.Crossref, Google Scholar
• [64] G. Kirlik and S. Sayın. Bilevel programming for generating discrete representations in multiobjective optimization. Mathematical Programming 169(2):585–604, 2018.Crossref, Google Scholar
• [65] G. Kirlik and S. Sayın. Generating representative sets for multiobjective discrete optimization problems with specified coverage errors. Computational Optimization and Applications 90(1):27–51, 2025.Crossref, Google Scholar
• [66] G. Kirlik and S. Sayın. A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. European Journal of Operational Research 232(3):479–488, 2014.Crossref, Google Scholar
• [67] K. Klamroth and M. M. Wiecek. Dynamic programming approaches to the multiple criteria knapsack problem. Naval Research Logistics 47(1):57–76, 2000.Crossref, Google Scholar
• [68] K. Klamroth, R. Lacour, and D. Vanderpooten. On the representation of the search region in multi-objective optimization. European Journal of Operational Research 245(3):767–778, 2015.Crossref, Google Scholar
• [69] M. Köksalan. Multiobjective combinatorial optimization: Some approaches. Journal of Multi-Criteria Decision Analysis 15(3–4):69–78, 2008.Crossref, Google Scholar
• [70] M. Köksalan and B. Lokman. Approximating the nondominated frontiers of multi-objective combinatorial optimization problems. Naval Research Logistics 56(2):191–198, 2009.Crossref, Google Scholar
• [71] M. Köksalan and B. Lokman. Finding nadir points in multi-objective integer programs. Journal of Global Optimization 62:55–77, 2015.Crossref, Google Scholar
• [72] D. Könen and M. Stiglmayr. On supportedness in multi-objective integer linear programming. Journal of Multi-Criteria Decision Analysis 32(3):e70024, 2025.Crossref, Google Scholar
• [73] P. Korhonen, J. Wallenius, and S. Zionts. Solving the discrete multiple criteria problem using convex cones. Management Science 30(11):1336–1345, 1984.Link, Google Scholar
• [74] T. Kuhn and S. Ruzika. A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions. Journal of Global Optimization 67(3):581–600, 2017.Crossref, Google Scholar
• [75] G. Lárraga and K. Miettinen. Survey of interactive evolutionary decomposition-based multiobjective optimization methods. Evolutionary Computation 1–45, 2026.Google Scholar
• [76] S. Li, F. Wang, Q. He, and X. Wang. Deep reinforcement learning for multi-objective combinatorial optimization: A case study on multi-objective traveling salesman problem. Swarm and Evolutionary Computation 83:101398, 2023.Crossref, Google Scholar
• [77] X. Lin, Z. Yang, and Q. Zhang. 2022. Pareto set learning for neural multi-objective combinatorial optimization. Preprint, submitted March 29, https://arxiv.org/abs/2203.15386.Google Scholar
• [78] B. Lokman. A survey on finding representative points for multi-objective integer programs and quality measures. Endüstri Mühendisliği 28(1):19–39, 2017.Google Scholar
• [79] B. Lokman and M. Köksalan. Finding all nondominated points of multi-objective integer programs. Journal of Global Optimization 57:347–365, 2013.Crossref, Google Scholar
• [80] B. Lokman, M. Köksalan, P. J. Korhonen, and J. Wallenius. An interactive algorithm to find the most preferred solution of multi-objective integer programs. Annals of Operations Research 245:67–95, 2016.Crossref, Google Scholar
• [81] B. Lokman, M. Köksalan, P. J. Korhonen, and J. Wallenius. An interactive approximation algorithm for multi-objective integer programs. Computers & Operations Research 96:80–90, 2018.Crossref, Google Scholar
• [82] Y. Lu, Z. Di, B. Li, S. Liu, H. Qian, P. Yang, and A. Zhou. Towards geometry-aware pareto set learning for neural multi-objective combinatorial optimization. Preprint, submitted May 14, https://arxiv.org/abs/2405.08604, 2024.Google Scholar
• [83] H. Ma, J. Liu, J. Li, and J. Jia. A comprehensive review on deep learning for multi-objective optimization. Swarm and Evolutionary Computation 101:102304, 2026.Crossref, Google Scholar
• [84] E. Q. V. Martins. On a multicriteria shortest path problem. European Journal of Operational Research 16(2):236–245, 1984.Crossref, Google Scholar
• [85] M. Masin and Y. Bukchin. Diversity maximization approach for multiobjective optimization. Operations Research 56(2):411–424, 2008.Link, Google Scholar
• [86] G. Mavrotas. Effective implementation of the $\epsilon$-constraint method in multi-objective mathematical programming problems. Applied Mathematics and Computation 213(2):455–465, 2009.Crossref, Google Scholar
• [87] G. Mavrotas and K. Florios. An improved version of the augmented $\epsilon$-constraint method (augmecon2) for finding the exact pareto set in multi-objective integer programming problems. Applied Mathematics and Computation 219(18):9652–9669, 2013.Crossref, Google Scholar
• [88] M. Mesquita-Cunha, A. P. Barbosa-Póvoa, and J. R. Figueira. An interactive method for multi-objective optimization: Integrating preferences through convex cones. Preprint, submitted April 10, https://doi.org/10.2139/ssrn.5034848, 2024.Google Scholar
• [89] M. Mesquita-Cunha, J. R. Figueira, and A. P. Barbosa-Póvoa. New epsilon-constraint methods for multi-objective integer linear programming: A pareto front representation approach. European Journal of Operational Research 306(1):286–307, 2023.Crossref, Google Scholar
• [90] K. Miettinen. Survey of methods to visualize alternatives in multiple criteria decision making problems. OR Spectrum 36(1):3–37, 2014.Crossref, Google Scholar
• [91] K. Miettinen, F. Ruiz, and A. P. Wierzbicki. Introduction to multiobjective optimization: Interactive approaches. J. Branke, K. Deb, K. Miettinen, and R. Slowinski, editors. Multiobjective Optimization: Interactive and Evolutionary Approaches. Springer, Berlin, 27–57, 2008.Crossref, Google Scholar
• [92] G. Misitano, B. Afsar, G. Lárraga, and K. Miettinen. Towards explainable interactive multiobjective optimization: R-XIMO. Autonomous Agents and Multi-Agent Systems 36(2):43, 2022.Crossref, Google Scholar
• [93] National Institute for Health and Care Excellence. Transperineal template biopsy and mapping of the prostate. Accessed May 10, 2026, https://www.nice.org.uk/guidance/htg237/chapter/2-The-procedure, 2010.Google Scholar
• [94] L. R. Nielsen. Multi-objective optimization repository. Accessed May 20, 2026, https://github.com/MCDMSociety/MOrepo, 2017.Google Scholar
• [95] S. Özarık, B. Lokman, and M. Köksalan. Distribution based representative sets for multi-objective integer programs. European Journal of Operational Research 284(2):632–643, 2020.Crossref, Google Scholar
• [96] M. Ozlen, B. A. Burton, and C. A. MacRae. Multi-objective integer programming: An improved recursive algorithm. Journal of Optimization Theory and Applications 160:470–482, 2014.Crossref, Google Scholar
• [97] Ö. Özpeynirci and M. Köksalan. An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs. Management Science 56(12):2302–2315, 2010.Link, Google Scholar
• [98] C. Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access of web sources. Proceedings of the 41st Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Washington, DC, 86–92, 2000.Google Scholar
• [99] D. Pecin, I. Herszterg, T. Perini, N. Boland, and M. Savelsbergh. A fast and robust algorithm for solving biobjective mixed integer programs. Mathematical Methods of Operations Research 100(1):221–262, 2024.Crossref, Google Scholar
• [100] W. Pettersson and M. Ozlen. Multiobjective integer programming: Synergistic parallel approaches. INFORMS Journal on Computing 32(2):461–472, 2020.Abstract, Google Scholar
• [101] S. Phelps and M. Köksalan. An interactive evolutionary metaheuristic for multiobjective combinatorial optimization. Management Science 49(12):1726–1738, 2003.Link, Google Scholar
• [102] R. C. Prim. Shortest connection networks and some generalizations. The Bell System Technical Journal 36(6):1389–1401, 1957.Crossref, Google Scholar
• [103] A. Przybylski and X. Gandibleux. Multi-objective branch and bound. European Journal of Operational Research 260(3):856–872, 2017.Crossref, Google Scholar
• [104] A. Przybylski, X. Gandibleux, and M. Ehrgott. A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discrete Optimization 7(3):149–165, 2010.Crossref, Google Scholar
• [105] A. Raith and M. Ehrgott. A comparison of solution strategies for biobjective shortest path problems. Computers & Operations Research 36(4):1299–1331, 2009.Crossref, Google Scholar
• [106] A. Raith, M. Schmidt, A. Schöbel, and L. Thom. Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty. European Journal of Operational Research 267(2):628–642, 2018.Crossref, Google Scholar
• [107] B. Roy. The outranking approach and the foundations of ELECTRE methods. Theory and Decision 31(1):49–73, 1991.Crossref, Google Scholar
• [108] T. L. Saaty. How to make a decision: The analytic hierarchy process. European Journal of Operational Research 48(1):9–26, 1990.Crossref, Google Scholar
• [109] S. Sayın. Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Mathematical Programming 87:543–560, 2000.Crossref, Google Scholar
• [110] S. Sayın and P. Kouvelis. The multiobjective discrete optimization problem: A weighted min-max two-stage optimization approach and a bicriteria algorithm. Management Science 51(10):1572–1581, 2005.Link, Google Scholar
• [111] C. Schaufler, R. Daigle, S. Singhaviranon, C. K. Gjertson, P. C. Albertsen, and B. T. Ristau. How many cores are enough? Optimizing the transperineal prostate biopsy template. Urologic Oncology: Seminars and Original Investigations 40(5):191.e1–191.e7, 2022.Crossref, Google Scholar
• [112] B. Schulze. New perspectives on multi-objective knapsack problems, PhD thesis, Universität Wuppertal, Wuppertal, Germany, 2017.Google Scholar
• [113] Y. Shao, J. Lin, G. Srivastava, D. Guo, H. Zhang, H. Yi, and A. Jolfaei. Multi-objective neural evolutionary algorithm for combinatorial optimization problems. IEEE Transactions on Neural Networks and Learning Systems 34(4):2133–2143, 2021.Crossref, Google Scholar
• [114] E. Silberberg. The Structure of Economics. McGraw-Hill, New York, 1978.Google Scholar
• [115] S. Steiner and T. Radzik. Computing all efficient solutions of the biobjective minimum spanning tree problem. Computers & Operations Research 35(1):198–211, 2008.Crossref, Google Scholar
• [116] R. E. Steuer and E. U. Choo. An interactive weighted tchebycheff procedure for multiple objective programming. Mathematical Programming 26(3):326–344, 1983.Crossref, Google Scholar
• [117] J. Sylva and A. Crema. A method for finding the set of non-dominated vectors for multiple objective integer linear programs. European Journal of Operational Research 158(1):46–55, 2004.Crossref, Google Scholar
• [118] J. Sylva and A. Crema. A method for finding well-dispersed subsets of nondominated vectors for multiple objective mixed integer linear programs. European Journal of Operational Research 180(3):1011–1027, 2007.Crossref, Google Scholar
• [119] S. Tamby and D. Vanderpooten. Enumeration of the nondominated set of multiobjective discrete optimization problems. INFORMS Journal on Computing 33(1):72–85, 2021.Link, Google Scholar
• [120] L. Thom. Solution methods for multi-objective robust combinatorial optimization, PhD thesis, Niedersächsische Staats und Universitätsbibliothek Göttingen, Göttingen, Germany, 2018.Google Scholar
• [121] M. Toloo, S. Talatahari, and I. Rahimi. Multi-Objective Combinatorial Optimization Problems and Solution Methods. Academic Press, London, 2022.Google Scholar
• [122] O. Turgut, E. Dalkiran, and A. E. Murat. An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems. Journal of Global Optimization 75(1):35–62, 2019.Crossref, Google Scholar
• [123] A. Tversky and D. Kahneman. Judgment under uncertainty: Heuristics and biases. Science 185(4157):1124–1131, 1974.Crossref, Google Scholar
• [124] E. L. Ulungu and J. Teghem. The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems. Foundations of Computing and Decision Sciences 20(2):149–165, 1994.Google Scholar
• [125] S. Verma, M. Pant, and V. Snasel. A comprehensive review on NSGA-II for multi-objective combinatorial optimization problems. IEEE Access 9:57757–57791, 2021.Crossref, Google Scholar
• [126] M. Visée, J. Teghem, M. Pirlot, and E. Ulungu. Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. Journal of Global Optimization 12(2):139–155, 1998. cited by: 181.Crossref, Google Scholar
• [127] J. Wallenius, J. S. Dyer, P. C. Fishburn, R. E. Steuer, S. Zionts, and K. Deb. Multiple criteria decision making, multiattribute utility theory: Recent accomplishments and what lies ahead. Management Science 54(7):1336–1349, 2008.Link, Google Scholar
• [128] Z. Wang, S. Yao, G. Li, and Q. Zhang. Multiobjective combinatorial optimization using a single deep reinforcement learning model. IEEE Transactions on Cybernetics 54(23):1984–1996, 2024.Crossref, Google Scholar
• [129] A. Warburton. Approximation of pareto optima in multiple-objective, shortest-path problems. Operations Research 35(1):70–79, 1987.Link, Google Scholar
• [130] M. Wiecek and G. Dranichak. Robust multi-objective optimization for decision making under uncertainty and conflict. A. Gupta, A. Capponi, J. C. Smith, and H. J. Greenberg, editors. Optimization Challenges in Complex, Networked and Risky Systems, INFORMS TutORials in Operations Research. INFORMS, Cantonsville, MD, 84–114, 2016.Google Scholar
• [131] A. P. Wierzbicki. A mathematical basis for satisficing decision making. Mathematical Modelling 3(5):391–405, 1982.Crossref, Google Scholar
• [132] A. P. Wierzbicki. A methodological approach to comparing parametric characterizations of efficient solutions. G. Fandel, M. Grauer, A. Kurzhanski, and A. P. Wierzbicki, editors. Large-Scale Modelling and Interactive Decision Analysis, Lecture Notes in Economics and Mathematical Systems, volume 273. Springer, Berlin, Heidelberg, 27–45, 1986. Google Scholar
• [133] L. A. Wolsey and G. L. Nemhauser. Integer and Combinatorial Optimization. John Wiley & Sons, New York, 1988.Google Scholar
• [134] P. L. Yu. A class of solutions for group decision problems. Management Science 19(8):936–946, 1973.Link, Google Scholar
• [135] L. Zadeh. Optimality and non-scalar-valued performance criteria. IEEE Transactions on Automatic Control 8(1):59–60, 1963.Crossref, Google Scholar
• [136] F. Zattoni, V. Fasulo, V. Kasivisvanathan, C. Kesch, G. Marra, A. Martini, U. Falagario, et al. Enhancing prostate cancer detection accuracy in magnetic resonance imaging–targeted prostate biopsy: Optimizing the number of cores taken. European Urology Open Science 66:16–25, 2024.Crossref, Google Scholar
• [137] S. Zionts and J. Wallenius. An interactive programming method for solving the multiple criteria problem. Management Science 22(6):652–663, 1976.Link, Google Scholar