{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:16:47Z","timestamp":1760141807036,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304446"},{"type":"electronic","value":"9783031304453"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30445-3_37","type":"book-chapter","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T09:02:52Z","timestamp":1682499772000},"page":"441-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Survey of\u00a0Interval Algorithms for\u00a0Solving Multicriteria Analysis Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5547-3759","authenticated-orcid":false,"given":"Bart\u0142omiej Jacek","family":"Kubica","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,27]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-36970-8_7","volume":"2632","author":"V Barichard","year":"2003","unstructured":"Barichard, V., Hao, J.K.: Population and interval constraint propagation algorithm. Lect. Notes Comput. Sci. 2632, 88\u2013101 (2003)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"1","key":"37_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1008215702611","volume":"13","author":"HP Benson","year":"1998","unstructured":"Benson, H.P.: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J. Global Optim. 13(1), 1\u201324 (1998)","journal-title":"J. Global Optim."},{"issue":"7","key":"37_CR3","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1287\/mnsc.26.7.694","volume":"26","author":"GR Bitran","year":"1980","unstructured":"Bitran, G.R.: Linear multiple objective problems with interval coefficients. Manage. Sci. 26(7), 694\u2013706 (1980)","journal-title":"Manage. Sci."},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Ceberio, M., Modave, F.: Interval-based multicriteria decision making. In: Bouchon-Meunier, B., Coletti, G., Yager, R.R. (eds.) Modern Information Processing, pp. 281\u2013294. Elsevier Science, Amsterdam","DOI":"10.1016\/B978-044452075-3\/50024-8"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/3-540-45356-3_83","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"K Deb","year":"2000","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Schoenauer, M., et al. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849\u2013858. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45356-3_83"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10898-006-9132-y","volume":"38","author":"J Fernandez","year":"2007","unstructured":"Fernandez, J., Toth, B.: Obtaining an outer approximation of the efficient set of nonlinear biobjective problems. J. Global Optim. 38, 315\u2013331 (2007)","journal-title":"J. Global Optim."},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"G-T\u00f3th, B., Kreinovich, V.: Verified methods for computing pareto sets: general algorithmic analysis. Int. J. Appl. Math. Comput. Sci. 19(3), 369\u2013380 (2009)","DOI":"10.2478\/v10006-009-0031-5"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Giove, S.: Interval TOPSIS for multicriteria decision making. In: Proceedings of the 13th Italian Workshop on Neural Nets, Lecture Notes in Computer Science 2486, pp. 56\u201363 (2002)","DOI":"10.1007\/3-540-45808-5_5"},{"issue":"4","key":"37_CR9","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s10898-013-0066-x","volume":"58","author":"A Goldsztejn","year":"2014","unstructured":"Goldsztejn, A., Domes, F., Chevalier, B.: First order rejection tests for multiple-objective optimization. J. Global Optim. 58(4), 653\u2013672 (2014)","journal-title":"J. Global Optim."},{"key":"37_CR10","volume-title":"Global Optimization Using Interval Analysis","author":"E Hansen","year":"2004","unstructured":"Hansen, E., Walster, W.: Global Optimization Using Interval Analysis. Marcel Dekker, New York (2004)"},{"issue":"5","key":"37_CR11","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1007\/s11590-011-0315-1","volume":"6","author":"M Hlad\u00edk","year":"2012","unstructured":"Hlad\u00edk, M.: Complexity of necessary efficiency in interval linear programming and multiobjective linear programming. Optim. Lett. 6(5), 893\u2013899 (2012)","journal-title":"Optim. Lett."},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Hwang, C.L., Yoon, K.: Multiple attribute decision making: methods and applications. Springer-Verlag (1981)","DOI":"10.1007\/978-3-642-48318-9"},{"issue":"3","key":"37_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(91)90169-V","volume":"52","author":"M Inuiguchi","year":"1991","unstructured":"Inuiguchi, M., Kume, Y.: Goal programming problems with interval coefficients and target intervals. Euro. J. Oper. Res. 52(3), 345\u2013360 (1991)","journal-title":"Euro. J. Oper. Res."},{"issue":"2","key":"37_CR14","first-page":"1375","volume":"175","author":"GR Jahanshahloo","year":"2006","unstructured":"Jahanshahloo, G.R., Lotfi, F.H., Izadikhah, M.: An algorithmic method to extend TOPSIS for decision-making problems with interval data. Appl. Math. Comput. 175(2), 1375\u20131384 (2006)","journal-title":"Appl. Math. Comput."},{"key":"37_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0249-6","volume-title":"Applied Interval Analysis","author":"L Jaulin","year":"2001","unstructured":"Jaulin, L., Kieffer, M., Didrit, O., Walter, \u00c9.: Applied Interval Analysis. Springer, London (2001). https:\/\/doi.org\/10.1007\/978-1-4471-0249-6"},{"issue":"4","key":"37_CR16","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1016\/0005-1098(93)90106-4","volume":"29","author":"L Jaulin","year":"1993","unstructured":"Jaulin, L., Walter, \u00c9.: Set inversion Via interval analysis for nonlinear bounded-error estimation. Automatica 29(4), 1053\u20131064 (1993)","journal-title":"Automatica"},{"key":"37_CR17","doi-asserted-by":"publisher","unstructured":"Jonez, D., Tamiz, M.: Practical Goal Programming, International Series in Operations Research & Management Science, vol. 141. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-1-4419-5771-9","DOI":"10.1007\/978-1-4419-5771-9"},{"key":"37_CR18","doi-asserted-by":"publisher","unstructured":"Kaucher, E.: Interval analysis in the extended interval space $$\\mathbb{I} \\mathbb{R} $$. In: Fundamentals of Numerical Computation (Computer-Oriented Numerical Analysis), pp. 33\u201349. Springer, Vienna (1980). https:\/\/doi.org\/10.1007\/978-3-7091-8577-3_3","DOI":"10.1007\/978-3-7091-8577-3_3"},{"key":"37_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2495-0","volume-title":"Rigorous Global Search: Continuous Problems","author":"RB Kearfott","year":"1996","unstructured":"Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer, Dordrecht (1996)"},{"issue":"1","key":"37_CR20","first-page":"7","volume":"15","author":"RB Kearfott","year":"2010","unstructured":"Kearfott, R.B., Nakao, M.T., Neumaier, A., Rump, S.M., Shary, S.P., van Hentenryck, P.: Standardized notation in interval analysis. Vychislennyie Tiehnologii (Computational Technologies) 15(1), 7\u201313 (2010)","journal-title":"Vychislennyie Tiehnologii (Computational Technologies)"},{"key":"37_CR21","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-13795-3","volume-title":"Interval Methods for Solving Nonlinear Constraint Satisfaction, Optimization and Similar Problems","author":"BJ Kubica","year":"2019","unstructured":"Kubica, B.J.: Interval Methods for Solving Nonlinear Constraint Satisfaction, Optimization and Similar Problems. SCI, vol. 805. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-13795-3"},{"key":"37_CR22","unstructured":"Kubica, B.J., Wo\u017aniak, A.: Interval componentwise Newton operator in computing the Pareto-front of constrained multicriterial problems. In: Proceedings of KKA 2008 Conference. EXIT (2008)"},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"Kubica, B.J., Wo\u017aniak, A.: Interval methods for computing the Pareto-front of a multicriterial problem. In: Lecture Notes in Computer Science 4967, pp. 1382\u20131391 (2009). PPAM 2007 Proceedings","DOI":"10.1007\/978-3-540-68111-3_146"},{"key":"37_CR24","unstructured":"Kubica, B.J., Wo\u017aniak, A.: A multi-threaded interval algorithm for the Pareto-front computation in a multi-core environment. In: Lecture Notes in Computer Science 6126\/6127 (2010). Accepted for publication. PARA 2008 Proceedings"},{"key":"37_CR25","first-page":"70","volume":"1","author":"BJ Kubica","year":"2010","unstructured":"Kubica, B.J., Wo\u017aniak, A.: Optimization of the multi-threaded interval algorithm for the Pareto-set computation. J. Telecommun. Inf. Technol. 1, 70\u201375 (2010)","journal-title":"J. Telecommun. Inf. Technol."},{"key":"37_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-28145-7_14","volume-title":"Applied Parallel and Scientific Computing","author":"BJ Kubica","year":"2012","unstructured":"Kubica, B.J., Wo\u017aniak, A.: Using the second-order information in pareto-set computations of a multi-criteria problem. In: J\u00f3nasson, K. (ed.) PARA 2010. LNCS, vol. 7134, pp. 137\u2013147. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28145-7_14"},{"key":"37_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-36803-5_38","volume-title":"Applied Parallel and Scientific Computing","author":"BJ Kubica","year":"2013","unstructured":"Kubica, B.J., Wo\u017aniak, A.: Tuning the interval algorithm for seeking pareto sets of multi-criteria problems. In: Manninen, P., \u00d6ster, P. (eds.) PARA 2012. LNCS, vol. 7782, pp. 504\u2013517. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36803-5_38"},{"key":"37_CR28","volume-title":"Computer Arithmetic and Validity - Theory Implementation and Applications","author":"U Kulisch","year":"2008","unstructured":"Kulisch, U.: Computer Arithmetic and Validity - Theory Implementation and Applications. De Gruyter, Berlin, New York (2008)"},{"key":"37_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21091-9","volume-title":"Multiobjective Linear Programming","author":"DT Luc","year":"2016","unstructured":"Luc, D.T.: Multiobjective Linear Programming. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-21091-9"},{"key":"37_CR30","unstructured":"Martin, B.: Rigorous algorithms for nonlinear biobjective optimization. Ph.D. thesis, Universit\u00e9 de Nantes (2014)"},{"issue":"3","key":"37_CR31","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1016\/j.ejor.2016.05.045","volume":"260","author":"B Martin","year":"2017","unstructured":"Martin, B., Goldsztejn, A., Granvilliers, L., Jermann, C.: Constraint propagation using dominance in interval branch & bound for nonlinear biobjective optimization. Euro. J. Oper. Res. 260(3), 934\u2013948 (2017)","journal-title":"Euro. J. Oper. Res."},{"key":"37_CR32","volume-title":"Nonlinear Multiobjective Optimization, International Series in Operations Research & Management Science","author":"K Miettinen","year":"1999","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization, International Series in Operations Research & Management Science, vol. 12. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"37_CR33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717716","volume-title":"Introduction to Interval Analysis","author":"RE Moore","year":"2009","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. SIAM, Philadelphia (2009)"},{"issue":"3","key":"37_CR34","doi-asserted-by":"publisher","first-page":"1434","DOI":"10.1016\/j.ejor.2005.12.042","volume":"181","author":"C Oliveira","year":"2007","unstructured":"Oliveira, C., Antunes, C.H.: Multiple objective linear programming models with interval coefficients - an illustrated overview. Euro. J. Oper. Res. 181(3), 1434\u20131463 (2007)","journal-title":"Euro. J. Oper. Res."},{"issue":"3","key":"37_CR35","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10700-015-9226-4","volume":"15","author":"S Rivaz","year":"2016","unstructured":"Rivaz, S., Yaghoobi, M.A., Hlad\u00edk, M.: Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem. Fuzzy Optim. Decis. Making 15(3), 237\u2013253 (2016)","journal-title":"Fuzzy Optim. Decis. Making"},{"issue":"1","key":"37_CR36","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00158-004-0496-7","volume":"30","author":"GR Ruetsch","year":"2005","unstructured":"Ruetsch, G.R.: An interval algorithm for multi-objective optimization. Struct. Multi. Optim. 30(1), 27\u201337 (2005)","journal-title":"Struct. Multi. Optim."},{"key":"37_CR37","doi-asserted-by":"crossref","unstructured":"Sen, S., Pal, B.B.: Interval goal programming approach to multiobjective fuzzy goal programming problem with interval weights. In: Procedia Technology, Proceedings of International Conference on Computational Intelligence: Modeling Techniques and Applications (CIMTA) 2013, vol. 10, pp. 587\u2013595 (2013)","DOI":"10.1016\/j.protcy.2013.12.399"},{"key":"37_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-31500-8_52","volume-title":"Parallel Processing and Applied Mathematics","author":"P Sevastjanov","year":"2012","unstructured":"Sevastjanov, P., Tikhonenko, A.: Direct interval extension of TOPSIS method. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wa\u015bniewski, J. (eds.) PPAM 2011. LNCS, vol. 7204, pp. 504\u2013512. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31500-8_52"},{"key":"37_CR39","volume-title":"Finite-dimensional Interval Analysis","author":"SP Shary","year":"2013","unstructured":"Shary, S.P.: Finite-dimensional Interval Analysis. Institute of Computational Technologies, SB RAS, Novosibirsk (2013)"},{"key":"37_CR40","doi-asserted-by":"publisher","unstructured":"Wierzbicki, A.P., Nakamori, Y.: Creative Environments: issues of creativity support for the knowledge civilization age, vol. 59. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-71562-7","DOI":"10.1007\/978-3-540-71562-7"},{"key":"37_CR41","doi-asserted-by":"publisher","unstructured":"Zeleny, M.: Linear multiobjective programming, Lecture Notes in Economics and Mathematical Systems, vol. 95. Springer Science & Business Media (2012). https:\/\/doi.org\/10.1007\/978-3-642-80808-1","DOI":"10.1007\/978-3-642-80808-1"},{"key":"37_CR42","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-report 103 (2001)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30445-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T04:45:03Z","timestamp":1760071503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30445-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304446","9783031304453"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30445-3_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gdansk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppam.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}