{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:34:50Z","timestamp":1740123290165,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T00:00:00Z","timestamp":1571356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T00:00:00Z","timestamp":1571356800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"TUPRAS","award":["OS.00054"],"award-info":[{"award-number":["OS.00054"]}]}],"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-03422-9","type":"journal-article","created":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T17:22:01Z","timestamp":1571419321000},"page":"841-876","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems"],"prefix":"10.1007","volume":"296","author":[{"given":"Seyyed Amir Babak","family":"Rasmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Fattahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4769-6714","authenticated-orcid":false,"given":"Metin","family":"T\u00fcrkay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,18]]},"reference":[{"issue":"3","key":"3422_CR1","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/S0377-2217(99)00183-6","volume":"124","author":"MJ Alves","year":"2000","unstructured":"Alves, M. J., & Cl\u0131maco, J. (2000). An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound. European Journal of Operational Research, 124(3), 478\u2013494.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3422_CR2","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.ejor.2015.06.072","volume":"248","author":"MJ Alves","year":"2016","unstructured":"Alves, M. J., & Costa, J. P. (2016). Graphical exploration of the weight space in three-objective mixed integer linear programs. European Journal of Operational Research, 248(1), 72\u201383.","journal-title":"European Journal of Operational Research"},{"issue":"21","key":"3422_CR3","doi-asserted-by":"crossref","first-page":"6266","DOI":"10.1080\/00207543.2017.1341064","volume":"55","author":"S Anvari","year":"2017","unstructured":"Anvari, S., & Turkay, M. (2017). The facility location problem from the perspective of triple bottom line accounting of sustainability. International Journal of Production Research, 55(21), 6266\u20136287.","journal-title":"International Journal of Production Research"},{"key":"3422_CR4","unstructured":"Belotti, P., Soylu, B., & Wiecek, M. M. (2013). A branch-and-bound algorithm for biobjective mixed-integer programs. Optimization Online. http:\/\/www.optimization-online.org\/DB_FILE\/2013\/01\/3719.pdf. Accessed 1 Jan 2017."},{"key":"3422_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.procir.2014.07.105","volume":"26","author":"R Bhinge","year":"2015","unstructured":"Bhinge, R., Moser, R., Moser, E., Lanza, G., & Dornfeld, D. (2015). Sustainability optimization for global supply chain decision-making. Procedia CIRP, 26, 323\u2013328.","journal-title":"Procedia CIRP"},{"issue":"4","key":"3422_CR6","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1287\/ijoc.2015.0657","volume":"27","author":"N Boland","year":"2015","unstructured":"Boland, N., Charkhgard, H., & Savelsbergh, M. (2015a). A criterion space search algorithm for biobjective integer programming: The balanced box method. INFORMS Journal on Computing, 27(4), 735\u2013754.","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"3422_CR7","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1287\/ijoc.2015.0646","volume":"27","author":"N Boland","year":"2015","unstructured":"Boland, N., Charkhgard, H., & Savelsbergh, M. (2015b). A criterion space search algorithm for biobjective mixed integer programming: The triangle splitting method. INFORMS Journal on Computing, 27(4), 597\u2013618.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"3422_CR8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s12532-015-0093-3","volume":"8","author":"N Boland","year":"2016","unstructured":"Boland, N., Charkhgard, H., & Savelsbergh, M. (2016). The l-shape search method for triobjective integer programming. Mathematical Programming Computation, 8(2), 217\u2013251.","journal-title":"Mathematical Programming Computation"},{"issue":"3","key":"3422_CR9","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.ejor.2016.03.035","volume":"260","author":"N Boland","year":"2017","unstructured":"Boland, N., Charkhgard, H., & Savelsbergh, M. (2017). The quadrant shrinking method: A simple and efficient algorithm for solving tri-objective integer programs. European Journal of Operational Research, 260(3), 873\u2013885.","journal-title":"European Journal of Operational Research"},{"key":"3422_CR10","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. (2008). Multiobjective optimization: Interactive and evolutionary approaches (Vol. 5252). Berlin: Springer."},{"key":"3422_CR11","doi-asserted-by":"publisher","unstructured":"Chen, Z., & Andresen, S. (2014). A multiobjective optimization model of production-sourcing for sustainable supply chain with consideration of social, environmental, and economic factors. Mathematical Problems in Engineering. https:\/\/doi.org\/10.1155\/2014\/616107.","DOI":"10.1155\/2014\/616107"},{"issue":"1","key":"3422_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0186-0","volume":"154","author":"A Chinchuluun","year":"2007","unstructured":"Chinchuluun, A., & Pardalos, P. M. (2007). A survey of recent developments in multiobjective optimization. Annals of Operations Research, 154(1), 29\u201350.","journal-title":"Annals of Operations Research"},{"key":"3422_CR13","volume-title":"Multicriteria optimization. Lecture Notes in Economics and Mathematical Systems","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M. (2000). Multicriteria optimization. Lecture Notes in Economics and Mathematical Systems (Vol. 491). Berlin: Springer."},{"issue":"1","key":"3422_CR14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10479-006-0074-z","volume":"147","author":"M Ehrgott","year":"2006","unstructured":"Ehrgott, M. (2006). A discussion of scalarization techniques for multiple objective integer programming. Annals of Operations Research, 147(1), 343\u2013360.","journal-title":"Annals of Operations Research"},{"key":"3422_CR15","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1007\/978-1-4939-3094-4_19","volume-title":"Multiple criteria analysis: Decision state of the art surveys","author":"M Ehrgott","year":"2016","unstructured":"Ehrgott, M., Gandibleux, X., & Przybylski, A. (2016). Exact methods for multi-objective combinatorial optimisation. In S. Greco, M. Ehrgott, & J. R. Figueira (Eds.), Multiple criteria analysis: Decision state of the art surveys (pp. 817\u2013850). Berlin: Springer."},{"key":"3422_CR16","first-page":"18","volume":"69","author":"J Elkington","year":"1999","unstructured":"Elkington, J. (1999). Triple bottom-line reporting: Looking for balance. AUSTRALIAN CPA, 69, 18\u201321.","journal-title":"AUSTRALIAN CPA"},{"issue":"1","key":"3422_CR17","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580111","volume":"5","author":"JP Evans","year":"1973","unstructured":"Evans, J. P., & Steuer, R. (1973). A revised simplex method for linear multiple objective programs. Mathematical Programming, 5(1), 54\u201372.","journal-title":"Mathematical Programming"},{"key":"3422_CR18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.compchemeng.2014.04.004","volume":"72","author":"A Fattahi","year":"2015","unstructured":"Fattahi, A., & Turkay, M. (2015). $$\\epsilon $$-OA for the solution of bi-objective generalized disjunctive programming problems in the synthesis of nonlinear process networks. Computers & Chemical Engineering, 72, 199\u2013209.","journal-title":"Computers & Chemical Engineering"},{"issue":"2","key":"3422_CR19","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.ejor.2017.09.026","volume":"266","author":"A Fattahi","year":"2018","unstructured":"Fattahi, A., & Turkay, M. (2018). A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems. European Journal of Operational Research, 266(2), 415\u2013425.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3422_CR20","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/0377-2217(94)90340-9","volume":"72","author":"B Fruhwirth","year":"1994","unstructured":"Fruhwirth, B., & Mekelburg, K. (1994). On the efficient point set of tricriteria linear programs. European Journal of Operational Research, 72(1), 192\u2013199.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3422_CR21","doi-asserted-by":"crossref","first-page":"98","DOI":"10.2507\/IJSIMM14(1)9.292","volume":"14","author":"H Hassine","year":"2015","unstructured":"Hassine, H., Barkallah, M., Bellacicco, A., Louati, J., Riviere, A., & Haddar, M. (2015). Multi objective optimization for sustainable manufacturing, application in turning. International Journal of Simulation Modelling, 14(1), 98\u2013109.","journal-title":"International Journal of Simulation Modelling"},{"key":"3422_CR22","doi-asserted-by":"crossref","unstructured":"Hooker, J. (2011) The logic of discrete variables. In R. L. Graham, & J. K. Lenstra (Eds.), Logic-based methods for optimization: combining optimization and constraint satisfaction (vol.\u00a02, pp. 61\u201368). Wiley.","DOI":"10.1002\/9781118033036.ch4"},{"issue":"1","key":"3422_CR23","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ejor.2008.02.005","volume":"195","author":"JM Jorge","year":"2009","unstructured":"Jorge, J. M. (2009). An algorithm for optimizing a linear function over an integer efficient set. European Journal of Operational Research, 195(1), 98\u2013103.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"3422_CR24","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10898-012-9955-7","volume":"57","author":"B Lokman","year":"2013","unstructured":"Lokman, B., & K\u00f6ksalan, M. (2013). Finding all nondominated points of multi-objective integer programs. Journal of Global Optimization, 57(2), 347\u2013365.","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"3422_CR25","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.amc.2005.01.038","volume":"171","author":"G Mavrotas","year":"2005","unstructured":"Mavrotas, G., & Diakoulaki, D. (2005). Multi-criteria branch and bound: A vector maximization algorithm for mixed 0\u20131 multiple objective linear programming. Applied Mathematics and Computation, 171(1), 53\u201371.","journal-title":"Applied Mathematics and Computation"},{"issue":"18","key":"3422_CR26","doi-asserted-by":"crossref","first-page":"9652","DOI":"10.1016\/j.amc.2013.03.002","volume":"219","author":"G Mavrotas","year":"2013","unstructured":"Mavrotas, G., & Florios, K. (2013). An improved version of the augmented $$\\varepsilon $$-constraint method (augmecon2) for finding the exact pareto set in multi-objective integer programming problems. Applied Mathematics and Computation, 219(18), 9652\u20139669.","journal-title":"Applied Mathematics and Computation"},{"key":"3422_CR27","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1007\/978-1-4939-3094-4_22","volume-title":"Multiple criteria decision analysis: State of the art surveys","author":"K Miettinen","year":"2016","unstructured":"Miettinen, K., Hakanen, J., & Podkopaev, D. (2016). Interactive nonlinear multiobjective optimization methods. In S. Greco, M. Ehrgott, & J. R. Figueira (Eds.), Multiple criteria decision analysis: State of the art surveys (pp. 927\u2013976). Berlin: Springer."},{"issue":"1","key":"3422_CR28","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"},{"issue":"2","key":"3422_CR29","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/s10957-013-0364-y","volume":"160","author":"M Ozlen","year":"2014","unstructured":"Ozlen, M., Burton, B. A., & MacRae, C. A. (2014). Multi-objective integer programming: An improved recursive algorithm. Journal of Optimization Theory and Applications, 160(2), 470\u2013482.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"12","key":"3422_CR30","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1287\/mnsc.1100.1248","volume":"56","author":"\u00d6 \u00d6zpeynirci","year":"2010","unstructured":"\u00d6zpeynirci, \u00d6., & K\u00f6ksalan, M. (2010). An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs. Management Science, 56(12), 2302\u20132315.","journal-title":"Management Science"},{"issue":"3","key":"3422_CR31","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1287\/ijoc.1090.0342","volume":"22","author":"A Przybylski","year":"2010","unstructured":"Przybylski, A., Gandibleux, X., & Ehrgott, M. (2010a). A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS Journal on Computing, 22(3), 371\u2013386.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"3422_CR32","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.disopt.2010.03.005","volume":"7","author":"A Przybylski","year":"2010","unstructured":"Przybylski, A., Gandibleux, X., & Ehrgott, M. (2010b). A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discrete Optimization, 7(3), 149\u2013165.","journal-title":"Discrete Optimization"},{"issue":"1","key":"3422_CR33","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s11081-018-9399-0","volume":"20","author":"SAB Rasmi","year":"2019","unstructured":"Rasmi, S. A. B., & T\u00fcrkay, M. (2019). Gondef: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs. Optimization and Engineering, 20(1), 89\u2013117.","journal-title":"Optimization and Engineering"},{"key":"3422_CR34","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/j.cie.2019.04.036","volume":"132","author":"SAB Rasmi","year":"2019","unstructured":"Rasmi, S. A. B., Kazan, C., & T\u00fcrkay, M. (2019). A multi-criteria decision analysis to include environmental, social, and cultural issues in the sustainable aggregate production plans. Computers & Industrial Engineering, 132, 348\u2013360.","journal-title":"Computers & Industrial Engineering"},{"key":"3422_CR35","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.cor.2016.03.001","volume":"72","author":"B Soylu","year":"2016","unstructured":"Soylu, B., & Y\u0131ld\u0131z, G. B. (2016). An exact algorithm for biobjective mixed integer linear programming problems. Computers & Operations Research, 72, 204\u2013213.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"3422_CR36","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/BF02591870","volume":"26","author":"RE Steuer","year":"1983","unstructured":"Steuer, R. E., & Choo, E. U. (1983). An interactive weighted tchebycheff procedure for multiple objective programming. Mathematical Programming, 26(3), 326\u2013344.","journal-title":"Mathematical Programming"},{"issue":"4","key":"3422_CR37","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1287\/mnsc.2013.1802","volume":"60","author":"T Stidsen","year":"2014","unstructured":"Stidsen, T., Andersen, K. A., & Dammann, B. (2014). A branch and bound algorithm for a class of biobjective mixed integer programs. Management Science, 60(4), 1009\u20131032.","journal-title":"Management Science"},{"issue":"1","key":"3422_CR38","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":"1","key":"3422_CR39","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2012.08.003","volume":"40","author":"T Vincent","year":"2013","unstructured":"Vincent, T., Seipp, F., Ruzika, S., Przybylski, A., & Gandibleux, X. (2013). Multiple objective branch and bound for mixed 0\u20131 linear programming: Corrections and improvements for the biobjective case. Computers & Operations Research, 40(1), 498\u2013509.","journal-title":"Computers & Operations Research"},{"key":"3422_CR40","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1007\/978-1-4939-3094-4_18","volume-title":"Multiple criteria decision analysis: State of the art surveys","author":"MM Wiecek","year":"2016","unstructured":"Wiecek, M. M., Ehrgott, M., & Engau, A. (2016). Continuous multiobjective programming. In S. Greco, M. Ehrgott, & J. R. Figueira (Eds.), Multiple criteria decision analysis: State of the art surveys (pp. 739\u2013815). Berlin: Springer."},{"issue":"2","key":"3422_CR41","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/0022-247X(75)90189-4","volume":"49","author":"P Yu","year":"1975","unstructured":"Yu, P., & Zeleny, M. (1975). The set of all nondominated solutions in linear cases and a multicriteria simplex method. Journal of Mathematical Analysis and Applications, 49(2), 430\u2013468.","journal-title":"Journal of Mathematical Analysis and Applications"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03422-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-019-03422-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03422-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T17:51:01Z","timestamp":1609869061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-019-03422-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,18]]},"references-count":41,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["3422"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03422-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2019,10,18]]},"assertion":[{"value":"18 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}