{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:45:41Z","timestamp":1740149141153,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T00:00:00Z","timestamp":1654473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T00:00:00Z","timestamp":1654473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s12351-022-00708-y","type":"journal-article","created":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T13:04:02Z","timestamp":1654520642000},"page":"5617-5673","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Probing the Pareto front of a large-scale multiobjective problem with a MIP solver"],"prefix":"10.1007","volume":"22","author":[{"given":"I.","family":"Kaliszewski","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1319-6239","authenticated-orcid":false,"given":"J.","family":"Miroforidis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,6]]},"reference":[{"key":"708_CR1","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1016\/j.asoc.2012.03.020","volume":"12","author":"A Ahmadi","year":"2012","unstructured":"Ahmadi A, Aghaei J, Shayanfar HA, Rabiee A (2012) Mixed integer programming of multiobjective hydro-thermal self scheduling. Appl Soft Comput 12:2137\u20132146","journal-title":"Appl Soft Comput"},{"key":"708_CR2","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejor.2007.06.068","volume":"199","author":"V Boyer","year":"2009","unstructured":"Boyer V, Elkihel M, El Baz D (2009) Heuristics for the 0\u20131 multidimensional knapsack problem. Eur J Oper Res 199:658\u2013664","journal-title":"Eur J Oper Res"},{"key":"708_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu PC, Beasley JE (1998) A genetic algorithm for the multidimensional knapsack problem. J Heurist 4:63\u201386","journal-title":"J Heurist"},{"key":"708_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary algorithms for solving multi-objective problems","author":"CAC Coello","year":"2002","unstructured":"Coello CAC, Van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer Academic Publishers, New York"},{"volume-title":"Applications of multi-objective evolutionary algorithms","year":"2004","key":"708_CR5","unstructured":"Coello CAC, Lamont GB (eds) (2004) Applications of multi-objective evolutionary algorithms. World Scientific Printers, Singapore"},{"key":"708_CR6","unstructured":"CPLEX (2021), https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio, last accessed May 13, 2021"},{"key":"708_CR7","doi-asserted-by":"publisher","first-page":"2929","DOI":"10.1016\/j.cor.2012.02.021","volume":"39","author":"K D\u00e4chert","year":"2012","unstructured":"D\u00e4chert K, Gorski J, Klamroth K (2012) An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems. Comput Oper Res 39:2929\u20132943","journal-title":"Comput Oper Res"},{"key":"708_CR8","doi-asserted-by":"publisher","unstructured":"Delorme X, Batta\u00efa O, Dolgui A (2014) Multi-objective approaches for design of assembly lines. In: Benyoucef L, Hennet JC, Tiwari M (eds) Applications of multi-criteria and game theory approaches. Springer series in advanced manufacturing, Springer, London. https:\/\/doi.org\/10.1007\/978-1-4471-5295-8_2","DOI":"10.1007\/978-1-4471-5295-8_2"},{"key":"708_CR9","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M (2005) Multicriteria optimization. Springer, Cham"},{"key":"708_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.ejor.2013.10.005","volume":"235","author":"HA Eiselt","year":"2014","unstructured":"Eiselt HA, Marianov V (2014) A bi-objective model for the location of landfills for municipal solid waste. Eur J Oper Res 235:187\u2013194","journal-title":"Eur J Oper Res"},{"key":"708_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville A (2004) The multidimensional 0\u20131 knapsack problem: an overview. Eur J Oper Res 155:1\u201321","journal-title":"Eur J Oper Res"},{"key":"708_CR12","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1287\/ijoc.2018.0846","volume":"31","author":"SA Gadegaard","year":"2019","unstructured":"Gadegaard SA, Nielsen LR, Ehrgott M (2019) Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets. INFORMS J Comput 31:790\u2013804","journal-title":"INFORMS J Comput"},{"key":"708_CR13","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F Glover","year":"1965","unstructured":"Glover F (1965) A multiphase-dual algorithm for the zero-one integer programming problem. Oper Res 13:879\u2013919","journal-title":"Oper Res"},{"key":"708_CR14","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1287\/opre.16.4.741","volume":"16","author":"F Glover","year":"1968","unstructured":"Glover F (1968) Surrogate Constraints. Oper Res 16:741\u2013749","journal-title":"Oper Res"},{"key":"708_CR15","unstructured":"Gurobi (2021), https:\/\/www.gurobi.com\/, last accessed May 13, 2021"},{"key":"708_CR16","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1287\/ijoc.1110.0476","volume":"24","author":"N Jozefowicz","year":"2012","unstructured":"Jozefowicz N, Laporte G, Semet F (2012) A generic branch-and-cut algorithm for multiobjective optimization problems: application to the Multilabel Traveling Salesman Problem. INFORMS J Comput 24:554\u2013564","journal-title":"INFORMS J Comput"},{"key":"708_CR17","volume-title":"Soft computing for complex multiple criteria decision making","author":"I Kaliszewski","year":"2006","unstructured":"Kaliszewski I (2006) Soft computing for complex multiple criteria decision making. Springer, New York"},{"key":"708_CR18","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s10957-013-0498-y","volume":"162","author":"I Kaliszewski","year":"2014","unstructured":"Kaliszewski I, Miroforidis J (2014) Two-sided Pareto front approximations. J Optim Theory Appl 162:845\u2013855","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"708_CR19","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10898-018-0642-1","volume":"72","author":"I Kaliszewski","year":"2018","unstructured":"Kaliszewski I, Miroforidis J (2018) On upper approximations of Pareto fronts. J Global Optim 72(3):475\u2013490","journal-title":"J Global Optim"},{"key":"708_CR20","doi-asserted-by":"publisher","first-page":"020038","DOI":"10.1063\/1.5090005","volume":"2070","author":"I Kaliszewski","year":"2019","unstructured":"Kaliszewski I, Miroforidis J (2019) Lower and upper bounds for the general multiobjective optimization problem. AIP Conf Proc 2070:020038","journal-title":"AIP Conf Proc"},{"key":"708_CR21","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10898-020-00946-4","volume":"79","author":"I Kaliszewski","year":"2021","unstructured":"Kaliszewski I, Miroforidis J (2021) Cooperative multiobjective optimization with bounds on objective functions. J Global Optim 79:369\u2013385","journal-title":"J Global Optim"},{"key":"708_CR22","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ejor.2011.07.013","volume":"216","author":"I Kaliszewski","year":"2012","unstructured":"Kaliszewski I, Miroforidis J, Podkopaev D (2012) Interactive multiple criteria decision making based on preference driven evolutionary multiobjective optimization with controllable accuracy. Eur J Oper Res 216:188\u2013199","journal-title":"Eur J Oper Res"},{"issue":"3","key":"708_CR23","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1108\/EC-03-2014-0065","volume":"33","author":"I Kaliszewski","year":"2016","unstructured":"Kaliszewski I, Kiczkowiak T, Miroforidis J (2016a) Mechanical design, multiple criteria decision making and Pareto optimality gap. Eng Comput 33(3):876\u2013895","journal-title":"Eng Comput"},{"key":"708_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32756-3","volume-title":"Multiple criteria decision making by multiobjective optimization\u2014a toolbox","author":"I Kaliszewski","year":"2016","unstructured":"Kaliszewski I, Miroforidis J, Podkopaev D (2016b) Multiple criteria decision making by multiobjective optimization\u2014a toolbox. Springer, Cham"},{"key":"708_CR25","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1111\/j.1475-3995.2011.00840.x","volume":"19","author":"T Lust","year":"2012","unstructured":"Lust T, Teghem J (2012) The multiobjective multidimensional knapsack problem: a survey and a new approach. Int Trans Oper Res 19:495\u2013520","journal-title":"Int Trans Oper Res"},{"key":"708_CR26","volume-title":"Knapsack problems\u2014algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems\u2014algorithms and computer implementations. John Wiley and Sons, New York"},{"issue":"18","key":"708_CR27","first-page":"9652","volume":"219","author":"G Mavrotas","year":"2013","unstructured":"Mavrotas G, Florios K (2013) An improved version of the augmented $$\\epsilon$$-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems. Appl Math Comput 219(18):9652\u20139669","journal-title":"Appl Math Comput"},{"key":"708_CR28","first-page":"25","volume":"270","author":"G Mavrotas","year":"2015","unstructured":"Mavrotas G, Florios K, Figueira JR (2015) An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics. Appl Math Comput 270:25\u201343","journal-title":"Appl Math Comput"},{"key":"708_CR29","volume-title":"Nonlinear multiobjective optimization","author":"KM Miettinen","year":"1999","unstructured":"Miettinen KM (1999) Nonlinear multiobjective optimization. Kluwer Academic Publishers, Amsterdam"},{"key":"708_CR30","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10898-021-01022-1","volume":"80","author":"J Miroforidis","year":"2021","unstructured":"Miroforidis J (2021) Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems. J Global Optim 80:617\u2013634","journal-title":"J Global Optim"},{"key":"708_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2015.02.010","volume":"61","author":"O Oke","year":"2015","unstructured":"Oke O, Siddiqui S (2015) Efficient automated schematic map drawing using multiobjective mixed integer programming. Comput Oper Res 61:1\u201317","journal-title":"Comput Oper Res"},{"key":"708_CR32","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.ejor.2017.01.032","volume":"260","author":"A Przybylski","year":"2017","unstructured":"Przybylski A, Gandibleux X (2017) Multi-objective branch and bound. Eur J Oper Res 260:856\u2013872","journal-title":"Eur J Oper Res"},{"key":"708_CR33","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10957-005-5494-4","volume":"126","author":"S Ruzika","year":"2005","unstructured":"Ruzika S, Wiecek MM (2005) Approximation methods in multiobjective programming. J Optim Theory Appl 126:473\u2013501","journal-title":"J Optim Theory Appl"},{"key":"708_CR34","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.ejor.2012.11.019","volume":"226","author":"F Samanlioglu","year":"2013","unstructured":"Samanlioglu F (2013) A multi-objective mathematical model for the industrial hazardous waste location-routing problem. Eur J Oper Res 226:332\u2013340","journal-title":"Eur J Oper Res"},{"key":"708_CR35","unstructured":"Smith NA, Tromble RW (2004) Sampling uniformly from the unit simplex. Technical Report, Center for Language and Speech Recognition, Johns Hopkins University, Department of Computer Science"},{"key":"708_CR36","volume-title":"Multiple criteria optimization: theory, computation and application","author":"RE Steuer","year":"1986","unstructured":"Steuer RE (1986) Multiple criteria optimization: theory, computation and application. John Wiley & Sons, New York"},{"key":"708_CR37","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1287\/mnsc.2013.1802","volume":"60","author":"TK Stidsen","year":"2014","unstructured":"Stidsen TK, Andersen A, Dammann B (2014) A branch and bound algorithm for a class of biobjective mixed integer programs. Manage Sci 60:1009\u20131032","journal-title":"Manage Sci"},{"key":"708_CR38","doi-asserted-by":"publisher","first-page":"3089","DOI":"10.1016\/j.cor.2012.03.010","volume":"39","author":"F Tricoire","year":"2012","unstructured":"Tricoire F (2012) Multi-directional local search. Comput Oper Res 39:3089\u20133101","journal-title":"Comput Oper Res"},{"key":"708_CR39","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01719738","volume":"8","author":"AP Wierzbicki","year":"1986","unstructured":"Wierzbicki AP (1986) On the completeness and constructiveness of parametric characterizations to vector optimization problems. OR Spectr 8:73\u201387","journal-title":"OR Spectr"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-022-00708-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-022-00708-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-022-00708-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T14:12:14Z","timestamp":1666361534000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-022-00708-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,6]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["708"],"URL":"https:\/\/doi.org\/10.1007\/s12351-022-00708-y","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2022,6,6]]},"assertion":[{"value":"11 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}