{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T22:00:39Z","timestamp":1777413639540,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:00:00Z","timestamp":1556582400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10898-019-00778-x","type":"journal-article","created":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:19:37Z","timestamp":1556630377000},"page":"35-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems"],"prefix":"10.1007","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7677-1184","authenticated-orcid":false,"given":"Ozgu","family":"Turgut","sequence":"first","affiliation":[]},{"given":"Evrim","family":"Dalkiran","sequence":"additional","affiliation":[]},{"given":"Alper E.","family":"Murat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,30]]},"reference":[{"issue":"3","key":"778_CR1","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1504\/IJMOR.2012.046690","volume":"4","author":"M Abbas","year":"2012","unstructured":"Abbas, M., Chergui, M.E.A., Mehdi, M.A.: Efficient cuts for generating the non-dominated vectors for multiple objective integer linear programming. Int. J. Math. Oper. Res. 4(3), 302\u2013316 (2012)","journal-title":"Int. J. Math. Oper. Res."},{"issue":"3","key":"778_CR2","doi-asserted-by":"publisher","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.: The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs. Eur. J. Oper. Res. 260(3), 873\u2013885 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"778_CR3","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s10898-014-0205-z","volume":"61","author":"K D\u00e4chert","year":"2015","unstructured":"D\u00e4chert, K., Klamroth, K.: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems. J. Glob. Optim. 61(4), 643\u2013676 (2015)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"778_CR4","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/j.ejor.2016.05.029","volume":"260","author":"K D\u00e4chert","year":"2017","unstructured":"D\u00e4chert, K., Klamroth, K., Lacour, R., Vanderpooten, D.: Efficient computation of the search region in multi-objective optimization. Eur. J. Oper. Res. 260(3), 841\u2013855 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"778_CR5","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1016\/j.cor.2005.10.003","volume":"34","author":"M Ehrgott","year":"2007","unstructured":"Ehrgott, M., Gandibleux, X.: Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34(9), 2674\u20132694 (2007)","journal-title":"Comput. Oper. Res."},{"key":"778_CR6","unstructured":"IBM ILOG CPLEX Optimization Studio. \n                    http:\/\/www.ilog.com\/products\/cplex\n                    \n                   (2016)"},{"issue":"1","key":"778_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79(1), 157\u2013181 (1993)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"778_CR8","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2013.08.001","volume":"232","author":"G Kirlik","year":"2014","unstructured":"Kirlik, G., Say\u0131n, S.: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur. J. Oper. Res. 232(3), 479\u2013488 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"778_CR9","doi-asserted-by":"publisher","first-page":"1444","DOI":"10.1287\/mnsc.29.12.1444","volume":"29","author":"G Kiziltan","year":"1983","unstructured":"Kiziltan, G., Yucao\u011flu, E.: An algorithm for multiobjective zero-one linear programming. Manag. Sci. 29(12), 1444\u20131453 (1983)","journal-title":"Manag. Sci."},{"issue":"3","key":"778_CR10","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/j.ejor.2015.03.031","volume":"245","author":"K Klamroth","year":"2015","unstructured":"Klamroth, K., Lacour, R., Vanderpooten, D.: On the representation of the search region in multi-objective optimization. Eur. J. Oper. Res. 245(3), 767\u2013778 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"778_CR11","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10898-012-9955-7","volume":"57","author":"B Lokman","year":"2013","unstructured":"Lokman, B., K\u00f6ksalan, M.: Finding all nondominated points of multi-objective integer programs. J. Glob. Optim. 57(2), 347\u2013365 (2013)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"778_CR12","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/S0377-2217(97)00077-5","volume":"107","author":"G Mavrotas","year":"1998","unstructured":"Mavrotas, G., Diakoulaki, D.: A branch and bound algorithm for mixed zero-one multiple objective linear programming. Eur. J. Oper. Res. 107(3), 530\u2013541 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"778_CR13","first-page":"53","volume":"171","author":"G Mavrotas","year":"2005","unstructured":"Mavrotas, G., Diakoulaki, D.: Multi-criteria branch and bound: a vector maximization algorithm for mixed 0\u20131 multiple objective linear programming. Appl. Math. Comput. 171(1), 53\u201371 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"778_CR14","doi-asserted-by":"publisher","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.: Multi-objective integer programming: an improved recursive algorithm. J. Optim. Theory Appl. 160(2), 470\u2013482 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"778_CR15","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1287\/ijoc.1090.0342","volume":"22","author":"A Przybylski","year":"2010","unstructured":"Przybylski, A., Gandibleux, X., Ehrgott, M.: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS J. Comput. 22(3), 371\u2013386 (2010a)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"778_CR16","doi-asserted-by":"publisher","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.: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discrete Optim. 7(3), 149\u2013165 (2010b)","journal-title":"Discrete Optim."},{"issue":"4","key":"778_CR17","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1287\/mnsc.2013.1802","volume":"60","author":"T Stidsen","year":"2014","unstructured":"Stidsen, T., Andersen, K.A., Dammann, B.: A branch and bound algorithm for a class of biobjective mixed integer programs. Manag. Sci. 60(4), 1009\u20131032 (2014)","journal-title":"Manag. Sci."},{"issue":"1","key":"778_CR18","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/S0377-2217(03)00255-8","volume":"158","author":"J Sylva","year":"2004","unstructured":"Sylva, J., Crema, A.: A method for finding the set of non-dominated vectors for multiple objective integer linear programs. Eur. J. Oper. Res. 158(1), 46\u201355 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"778_CR19","unstructured":"Ulungu, B., Teghem, J., Fortemps, P.: Heuristic for multi-objective combinatorial optimization problems by simulated annealing. MCDM Theory Appl. 1995 (1995)"},{"issue":"1","key":"778_CR20","doi-asserted-by":"publisher","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.: Multiple objective branch and bound for mixed 0\u20131 linear programming: corrections and improvements for the biobjective case. Comput. Oper. Res. 40(1), 498\u2013509 (2013)","journal-title":"Comput. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00778-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00778-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00778-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T23:37:51Z","timestamp":1588117071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00778-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,30]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["778"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00778-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,30]]},"assertion":[{"value":"28 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}