{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T12:52:38Z","timestamp":1780145558777,"version":"3.54.0"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T00:00:00Z","timestamp":1563926400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T00:00:00Z","timestamp":1563926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/MAT\/04561\/2013"],"award-info":[{"award-number":["UID\/MAT\/04561\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["UID\/Multi\/00491\/2013"],"award-info":[{"award-number":["UID\/Multi\/00491\/2013"]}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s10479-019-03317-9","type":"journal-article","created":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T11:09:50Z","timestamp":1563966590000},"page":"35-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems"],"prefix":"10.1007","volume":"296","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5088-134X","authenticated-orcid":false,"given":"Angelo","family":"Aliano Filho","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio Carlos","family":"Moretti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Margarida Vaz","family":"Pato","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Washington Alves","family":"de Oliveira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"issue":"1","key":"3317_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1057\/s41274-017-0214-7","volume":"69","author":"A Aliano Filho","year":"2018","unstructured":"Aliano Filho, A., Moretti, A. C., & Pato, M. V. (2018). A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problem. Journal of the Operational Research Society, 69(1), 91\u2013107.","journal-title":"Journal of the Operational Research Society"},{"key":"3317_CR2","doi-asserted-by":"crossref","unstructured":"Anthony, P., Xavier, G., & Ehrgott, M. (2009). Computational results for four exact methods to solve the three-objective assignment problem. In Multiobjective programming and goal programming (pp. 79\u201388). Berlin: Springer","DOI":"10.1007\/978-3-540-85646-7_8"},{"key":"3317_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1590\/S0101-74382000000200010","volume":"20","author":"SA Araujo","year":"2000","unstructured":"Araujo, S. A., & Arenales, M. N. (2000). Problema de dimensionamento de lotes monoest\u00e1gio com restri\u00e7\u00e3o de capacidade: modelagem, m\u00e9todo de resolu\u00e7\u00e3o e resultados computacionais. Pesquisa Operacional, 20, 287\u2013306.","journal-title":"Pesquisa Operacional"},{"issue":"2","key":"3317_CR4","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1016\/j.ejor.2006.12.026","volume":"185","author":"M Ben-Daya","year":"2008","unstructured":"Ben-Daya, M., Darwish, M., & Ertogral, K. (2008). The joint economic lot sizing problem: Review and extensions. European Journal of Operational Research, 185(2), 726\u2013742.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"3317_CR5","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/BF00933152","volume":"26","author":"H Benson","year":"1978","unstructured":"Benson, H. (1978). Existence of efficient solutions for vector maximization problems. Journal of Optimization Theory and Applications, 26(4), 569\u2013580.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1","key":"3317_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1008215702611","volume":"13","author":"H Benson","year":"1998","unstructured":"Benson, H. (1998). An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. Journal of Global Optimization, 13(1), 1\u201324.","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"3317_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ejor.2007.12.014","volume":"194","author":"JF B\u00e9rub\u00e9","year":"2009","unstructured":"B\u00e9rub\u00e9, J. F., Gendreau, M., & Potvin, J. Y. (2009). An exact $$\\varepsilon $$-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits. European Journal of Operational Research, 194(1), 39\u201350.","journal-title":"European Journal of Operational Research"},{"key":"3317_CR8","series-title":"Lecture notes in economics and mathematical systems","volume-title":"Multiple criteria decision making","author":"V Bowman","year":"1976","unstructured":"Bowman, V. (1976). On the relationship of the Tchebycheff norm and the efficient frontier of multiple-criteria objectives. In H. Thieriez (Ed.), Multiple criteria decision making (Vol. 130)., Lecture notes in economics and mathematical systems Berlin: Springer."},{"key":"3317_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-88908-3","volume-title":"Multiobjective optimization: Interactive and evolutionary approaches","author":"J Branke","year":"2008","unstructured":"Branke, J., Deb, K., Miettinen, K., & Slowi\u0144ski, R. (2008). Multiobjective optimization: Interactive and evolutionary approaches (Vol. 5252)., Lecture notes in computer science Berlin: Springer."},{"key":"3317_CR10","doi-asserted-by":"crossref","unstructured":"Cl\u00edmaco, J., Ferreira, C., & Captivo, M.\u00a0E. (1997a). Multicriteria integer programming: An overview of the different algorithmic approaches. In Multicriteria analysis: Proceedings of the XIth international conference on MCDM, 1\u20136 August 1994, Coimbra, Portugal (pp. 248\u2013258). Berlin: Springer.","DOI":"10.1007\/978-3-642-60667-0_24"},{"key":"3317_CR11","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/978-3-642-60667-0_24","volume-title":"Multicriteria analysis","author":"J Cl\u00edmaco","year":"1997","unstructured":"Cl\u00edmaco, J., Ferreira, C., & Captivo, M. E. (1997b). Multicriteria integer programming: An overview of the different algorithmic approaches. In J. Cl\u00edmaco (Ed.), Multicriteria analysis (pp. 248\u2013258). Berlin: Springer."},{"key":"3317_CR12","volume-title":"Multiobjective programming and planning","author":"JL Cohon","year":"2003","unstructured":"Cohon, J. L. (2003). Multiobjective programming and planning. Mineola, NY: Dover Publications. (Originally published: New York: Academic Press, 2003. in series: Mathematics in Science and Engineering. With new pref.)."},{"issue":"4","key":"3317_CR13","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.cor.2003.08.017","volume":"32","author":"Y Collette","year":"2005","unstructured":"Collette, Y., & Siarry, P. (2005). Three new metrics to measure the convergence of metaheuristics towards the pareto frontier and the aesthetic of a set of solutions in biobjective optimization. Computers and Operations Research, 32(4), 773\u2013792.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"3317_CR14","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P Czyz\u017cak","year":"1998","unstructured":"Czyz\u017cak, P., & Jaszkiewicz, A. (1998). Pareto simulated annealing\u2014A metaheuristic technique for multiple-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis, 7(1), 34\u201347.","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"issue":"12","key":"3317_CR15","doi-asserted-by":"crossref","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. Computational and Operational Research, 39(12), 2929\u20132943.","journal-title":"Computational and Operational Research"},{"issue":"1","key":"3317_CR16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.orl.2017.11.011","volume":"46","author":"R Dai","year":"2018","unstructured":"Dai, R., & Charkhgard, H. (2018). A two-stage approach for bi-objective integer linear programming. Operations Research Letters, 46(1), 81\u201387.","journal-title":"Operations Research Letters"},{"issue":"3","key":"3317_CR17","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das, I., & Dennis, J. E. (1998). Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM Journal on Optimization, 8(3), 631\u2013657.","journal-title":"SIAM Journal on Optimization"},{"key":"3317_CR18","doi-asserted-by":"crossref","unstructured":"Deb, K. (2014). Multi-objective optimization. In Search methodologies (pp. 403\u2013449). Boston: Springer.","DOI":"10.1007\/978-1-4614-6940-7_15"},{"key":"3317_CR19","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K., & Kalyanmoy, D. (2001). Multi-objective optimization using evolutionary algorithms. New York, NY: Wiley."},{"key":"3317_CR20","doi-asserted-by":"crossref","unstructured":"Deb, K. & Sundar, J. (2006). Reference point based multi-objective optimization using evolutionary algorithms. In Proceedings of the 8th annual conference on genetic and evolutionary computation, GECCO \u201906 (pp. 635\u2013642). New York, NY: ACM.","DOI":"10.1145\/1143997.1144112"},{"key":"3317_CR21","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M. (2005). Multicriteria optimization (Vol. 491). Berlin: Springer."},{"issue":"4","key":"3317_CR22","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M., & Gandibleux, X. (2000). A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum, 22(4), 425\u2013460.","journal-title":"OR Spektrum"},{"key":"3317_CR23","first-page":"369","volume-title":"Multiobjective combinatorial optimization\u2014Theory, methodology, and applications","author":"M Ehrgott","year":"2002","unstructured":"Ehrgott, M., & Gandibleux, X. (2002). Multiobjective combinatorial optimization\u2014Theory, methodology, and applications (pp. 369\u2013444). Boston, MA: Springer."},{"issue":"3","key":"3317_CR24","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/0377-2217(95)00023-J","volume":"84","author":"T Gau","year":"1995","unstructured":"Gau, T., & Wascher, G. (1995). CUTGEN: A problem generator for the standard one-dimensional cutting stock problem. European Journal of Operational Research, 84(3), 572\u2013579.","journal-title":"European Journal of Operational Research"},{"key":"3317_CR25","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P. C., & Gomory, R. E. (1961). A linear programming approach to the cutting-stock problem. Operations Research, 9, 848\u2013859.","journal-title":"Operations Research"},{"key":"3317_CR26","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"PC Gilmore","year":"1963","unstructured":"Gilmore, P. C., & Gomory, R. E. (1963). A linear programming approach to the cutting-stock problem\u2014part II. Operations Research, 11, 863\u2013888.","journal-title":"Operations Research"},{"key":"3317_CR27","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1590\/S0101-74382009000200006","volume":"9","author":"RR Golfeto","year":"2009","unstructured":"Golfeto, R. R., Moretti, A. C., & Salles, L. L. N. (2009). A genetic symbiotic algorithm applied to the one-dimensional cutting stock problem. Pesquisa Operacional (impresso), 9, 365\u2013382.","journal-title":"Pesquisa Operacional (impresso)"},{"issue":"5","key":"3317_CR28","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","volume":"31","author":"B Karimi","year":"2003","unstructured":"Karimi, B., Ghomi, S. F., & Wilson, J. (2003). The capacitated lot sizing problem: A review of models and algorithms. Omega, 31(5), 365\u2013378.","journal-title":"Omega"},{"issue":"11","key":"3317_CR29","doi-asserted-by":"crossref","first-page":"1833","DOI":"10.1016\/S0305-0548(03)00142-4","volume":"31","author":"O Kettani","year":"2004","unstructured":"Kettani, O., Aouni\u00efd, B., & Martel, J. M. (2004). The double role of the weight factor in the goal programming model. Computers and Operations Research, 31(11), 1833\u20131845.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"3317_CR30","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00158-004-0465-1","volume":"29","author":"I Kim","year":"2005","unstructured":"Kim, I., & de Weck, O. (2005). Adaptive weighted-sum method for bi-objective optimization: Pareto front generation. Structural and Multidisciplinary Optimization, 29(2), 149\u2013158.","journal-title":"Structural and Multidisciplinary Optimization"},{"issue":"4","key":"3317_CR31","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/0377-2217(82)90182-5","volume":"9","author":"D Klein","year":"1982","unstructured":"Klein, D., & Hannan, E. (1982). An algorithm for the multiple objective integer linear programming problem. European Journal of Operational Research, 9(4), 378\u2013385.","journal-title":"European Journal of Operational Research"},{"key":"3317_CR32","doi-asserted-by":"crossref","unstructured":"Knowles, J., & Corne, D. (2002). On metrics for comparing nondominated sets. In Proceedings of the 2002 congress on evolutionary computation, 2002. CEC\u201902 (Vol.\u00a01, pp. 711\u2013716). IEEE.","DOI":"10.1109\/CEC.2002.1007013"},{"issue":"3","key":"3317_CR33","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1016\/j.ejor.2004.08.029","volume":"169","author":"M Laumanns","year":"2006","unstructured":"Laumanns, M., Thiele, L., & Zitzler, E. (2006). An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. European Journal of Operational Research, 169(3), 932\u2013942.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3317_CR34","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10479-012-1190-6","volume":"210","author":"R Lazimy","year":"2013","unstructured":"Lazimy, R. (2013). Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems. Annals of Operations Research, 210(1), 73\u201399.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3317_CR35","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s11590-014-0743-9","volume":"9","author":"M Luque","year":"2015","unstructured":"Luque, M. (2015). Modified interactive Tchebyshev algorithm (MICA) for non-convex multiobjective programming. Optimization Letters, 9(1), 173\u2013187.","journal-title":"Optimization Letters"},{"issue":"4","key":"3317_CR36","doi-asserted-by":"crossref","first-page":"2205","DOI":"10.1016\/j.eswa.2014.10.028","volume":"42","author":"M Luque","year":"2015","unstructured":"Luque, M., Lopez-Agudo, L., & Marcenaro-Gutierrez, O. (2015). Equivalent reference points in multiobjective programming. Expert Systems with Applications, 42(4), 2205\u20132212.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"3317_CR37","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1016\/j.omega.2007.06.001","volume":"37","author":"M Luque","year":"2009","unstructured":"Luque, M., Miettinen, K., Eskelinen, P., & Ruiz, F. (2009). Incorporating preference information in interactive reference point methods for multiobjective optimization. Omega, 37(2), 450\u2013462.","journal-title":"Omega"},{"issue":"7","key":"3317_CR38","doi-asserted-by":"crossref","first-page":"1673","DOI":"10.1016\/j.cor.2011.10.002","volume":"39","author":"M Luque","year":"2012","unstructured":"Luque, M., Miettinen, K., Ruiz, A. B., & Ruiz, F. (2012). A two-slope achievement scalarizing function for interactive multiobjective optimization. Computers and Operations Research, 39(7), 1673\u20131681.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"3317_CR39","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/j.ejor.2009.11.011","volume":"204","author":"M Luque","year":"2010","unstructured":"Luque, M., Ruiz, F., & Steuer, R. E. (2010). Modified interactive Tchebyshev algorithm (MICA) for convex multiobjective programming. European Journal of Operational Research, 204(3), 557\u2013564.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3317_CR40","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"OB Madsen","year":"1995","unstructured":"Madsen, O. B., Ravn, H. F., & Rygaard, J. M. (1995). A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research, 60(1), 193\u2013208.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"3317_CR41","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/s00158-002-0276-1","volume":"25","author":"A Messac","year":"2003","unstructured":"Messac, A., Ismail-Yahaya, A., & Mattson, C. (2003). The normalized normal constraint method for generating the Pareto frontier. Structural and Multidisciplinary Optimization, 25(2), 86\u201398.","journal-title":"Structural and Multidisciplinary Optimization"},{"key":"3317_CR42","series-title":"volume\u00a012 of International series in operations research and management science","volume-title":"Nonlinear multiobjective optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen, K. (1999). Nonlinear multiobjective optimization., volume\u00a012 of International series in operations research and management science Dordrecht: Kluwer."},{"key":"3317_CR43","doi-asserted-by":"crossref","unstructured":"Miettinen, K., Eskelinen, P., Luque, M., & Ruiz, F. (2009). On the use of preferential weights in interactive reference point based methods. In Multiobjective programming and goal programming (pp. 211\u2013220). Berlin: Springer.","DOI":"10.1007\/978-3-540-85646-7_20"},{"issue":"2","key":"3317_CR44","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/j.ejor.2008.07.015","volume":"197","author":"J Molina","year":"2009","unstructured":"Molina, J., Santana, L. V., Hern\u00e1ndez-D\u00edaz, A. G., Coello, C. A. C., & Caballero, R. (2009). g-dominance: Reference point based dominance for multiobjective metaheuristics. European Journal of Operational Research, 197(2), 685\u2013692.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"3317_CR45","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01720321","volume":"16","author":"P Neumayer","year":"1994","unstructured":"Neumayer, P., & Schweigert, D. (1994). Three algorithms for bicriteria integer linear programs. Operations Research Spektrum, 16(4), 267\u2013276.","journal-title":"Operations Research Spektrum"},{"issue":"1\u20132","key":"3317_CR46","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s10479-017-2698-6","volume":"267","author":"FZ Oua\u00efl","year":"2018","unstructured":"Oua\u00efl, F. Z., & Chergui, M. E. A. (2018). A branch-and-cut technique to solve multiobjective integer quadratic programming problems. Annals of Operations Research, 267(1\u20132), 431\u2013446.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3317_CR47","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ejor.2008.10.023","volume":"199","author":"M \u00d6zlen","year":"2009","unstructured":"\u00d6zlen, M., & Azizo\u011flu, M. (2009). Multi-objective integer programming: A general approach for generating all non-dominated solutions. European Journal of Operational Research, 199(1), 25\u201335.","journal-title":"European Journal of Operational Research"},{"key":"3317_CR48","doi-asserted-by":"crossref","first-page":"2074","DOI":"10.1016\/j.cor.2008.07.001","volume":"36","author":"KC Poldi","year":"2009","unstructured":"Poldi, K. C., & Arenales, M. N. (2009). Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths. Computers and Operations Research, 36, 2074\u20132081.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"3317_CR49","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10479-006-0058-z","volume":"147","author":"TK Ralphs","year":"2006","unstructured":"Ralphs, T. K., Saltzman, M. J., & Wiecek, M. M. (2006). An improved algorithm for solving biobjective integer programs. Annals of Operations Research, 147(1), 43\u201370.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"3317_CR50","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10957-005-5494-4","volume":"126","author":"S Ruzika","year":"2003","unstructured":"Ruzika, S., & Wiecek, M. M. (2003). A survey of approximation methods in multiobjective programming. Journal of Optimization Theory and Applications, 126(3), 473\u2013501.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"3","key":"3317_CR51","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10957-005-5494-4","volume":"126","author":"S Ruzika","year":"2005","unstructured":"Ruzika, S., & Wiecek, M. M. (2005). Approximation methods in multiobjective programming. Journal of Optimization Theory and Applications, 126(3), 473\u2013501.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"3","key":"3317_CR52","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1016\/j.ejor.2006.05.023","volume":"180","author":"T Sawik","year":"2007","unstructured":"Sawik, T. (2007). A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing. European Journal of Operational Research, 180(3), 1060\u20131075.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"3317_CR53","doi-asserted-by":"crossref","first-page":"1572","DOI":"10.1287\/mnsc.1050.0413","volume":"51","author":"S Sayin","year":"2005","unstructured":"Sayin, S., & Kouvelis, P. (2005). The multiobjective discrete optimization problem: A weighted min-max two-stage optimization approach and a bicriteria algorithm. Management Science, 51(10), 1572\u20131581.","journal-title":"Management Science"},{"issue":"1","key":"3317_CR54","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1011267305444","volume":"20","author":"B Schandl","year":"2001","unstructured":"Schandl, B., Klamroth, K., & Wiecek, M. (2001). Norm-based approximation in bicriteria programming. Computational Optimization and Applications, 20(1), 23\u201342.","journal-title":"Computational Optimization and Applications"},{"issue":"3","key":"3317_CR55","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.ejor.2016.05.001","volume":"255","author":"L Shao","year":"2016","unstructured":"Shao, L., & Ehrgott, M. (2016). Discrete representation of non-dominated sets in multi-objective linear programming. European Journal of Operational Research, 255(3), 687\u2013698.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"3317_CR56","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1007\/s12205-016-2569-8","volume":"21","author":"HS Shim","year":"2017","unstructured":"Shim, H. S., Lee, S. H., & Kang, B. S. (2017). Pareto front generation for bridge deck management system using bi-objective optimization. KSCE Journal of Civil Engineering, 21(5), 1563\u20131572.","journal-title":"KSCE Journal of Civil Engineering"},{"key":"3317_CR57","first-page":"310","volume-title":"On the normal boundary intersection method for generation of efficient front","author":"PK Shukla","year":"2007","unstructured":"Shukla, P. K. (2007). On the normal boundary intersection method for generation of efficient front (pp. 310\u2013317). Berlin: Springer."},{"issue":"1","key":"3317_CR58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0305-0548(91)90037-R","volume":"18","author":"R Solanki","year":"1991","unstructured":"Solanki, R. (1991). Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem. Computers and Operations Research, 18(1), 1\u201315.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"3317_CR59","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/BF02591870","volume":"26","author":"R Steuer","year":"1983","unstructured":"Steuer, R., & Choo, E.-U. (1983). An interactive weighted Tchebycheff procedure for multiple objective programming. Mathematical Programming, 26(3), 326\u2013344.","journal-title":"Mathematical Programming"},{"issue":"1","key":"3317_CR60","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/S0377-2217(03)00255-8","volume":"158","author":"J Sylva","year":"2004","unstructured":"Sylva, J., & Crema, A. (2004). A method for finding the set of non-dominated vectors for multiple objective integer linear programs. European Journal of Operational Research, 158(1), 46\u201355.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"3317_CR61","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.omega.2006.12.004","volume":"36","author":"O Ustun","year":"2008","unstructured":"Ustun, O., & Demirtas, E. A. (2008). An integrated multi-objective decision-making process for multi-period lot-sizing with supplier selection. Omega, 36(4), 509\u2013521. (Special Issue on Logistics: New Perspectives and Challenges.).","journal-title":"Omega"},{"key":"3317_CR62","doi-asserted-by":"crossref","unstructured":"Wierzbicki, A. P. (1980). The use of reference objectives in multiobjective optimization. In Multiple criteria decision making theory and application (pp. 468\u2013486). Berlin: Springer.","DOI":"10.1007\/978-3-642-48782-8_32"},{"issue":"2","key":"3317_CR63","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.cie.2005.01.018","volume":"48","author":"W Xia","year":"2005","unstructured":"Xia, W., & Wu, Z. (2005). An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers and Industrial Engineering, 48(2), 409\u2013425.","journal-title":"Computers and Industrial Engineering"}],"updated-by":[{"DOI":"10.1007\/s10479-021-04004-4","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T00:00:00Z","timestamp":1614902400000}}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03317-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-019-03317-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03317-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T19:56:37Z","timestamp":1627674997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-019-03317-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,24]]},"references-count":63,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["3317"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03317-9","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10479-021-04004-4","asserted-by":"object"}]},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,24]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2021","order":2,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":4,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10479-021-04004-4","URL":"https:\/\/doi.org\/10.1007\/s10479-021-04004-4","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}