{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T08:07:27Z","timestamp":1781597247667,"version":"3.54.5"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,6,22]],"date-time":"2014-06-22T00:00:00Z","timestamp":1403395200000},"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":[[2015,4]]},"DOI":"10.1007\/s10898-014-0205-z","type":"journal-article","created":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T09:16:44Z","timestamp":1403342204000},"page":"643-676","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems"],"prefix":"10.1007","volume":"61","author":[{"given":"Kerstin","family":"D\u00e4chert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kathrin","family":"Klamroth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,6,22]]},"reference":[{"key":"205_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"YP Aneja","year":"1979","unstructured":"Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Manage. Sci. 25, 73\u201378 (1979)","journal-title":"Manage. Sci."},{"key":"205_CR2","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/0377-2217(86)90093-7","volume":"25","author":"L Chalmet","year":"1986","unstructured":"Chalmet, L., Lemonidis, L., Elzinga, D.: An algorithm for the bi-criterion integer programming problem. Eur. J. Oper. Res. 25, 292\u2013300 (1986)","journal-title":"Eur. J. Oper. Res."},{"key":"205_CR3","unstructured":"D\u00e4chert, K.: Adaptive parametric scalarizations in multicriteria optimization. Ph.D. thesis, University of Wuppertal, Germany (2014)"},{"key":"205_CR4","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.: An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems. Comput. Oper. Res. 39, 2929\u20132943 (2012)","journal-title":"Comput. Oper. Res."},{"key":"205_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ejor.2008.12.034","volume":"200","author":"C Dhaenens","year":"2010","unstructured":"Dhaenens, C., Lemesre, J., Talbi, E.-G.: K-PPM: A new exact method to solve multi-objective combinatorial optimization problems. Eur. J. Oper. Res. 200, 45\u201353 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"205_CR6","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2005)"},{"key":"205_CR7","doi-asserted-by":"crossref","unstructured":"Eswaran, P., Ravindran, A., Moskowitz, H.: Algorithms for nonlinear integer bicriterion problems. J. Optim. Theory Appl. 63(2), 261\u2013279 (1989)","DOI":"10.1007\/BF00939577"},{"issue":"3","key":"205_CR8","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.orl.2006.03.019","volume":"35","author":"HW Hamacher","year":"2007","unstructured":"Hamacher, H.W., Pedersen, C.R., Ruzika, S.: Finding representative systems for discrete bicriteria optimization problems by box algorithms. Oper. Res. Lett. 35(3), 336\u2013344 (2007)","journal-title":"Oper. Res. Lett."},{"key":"205_CR9","doi-asserted-by":"crossref","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, 479\u2013488 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"205_CR10","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.: An algorithm for the multiple objective integer linear programming problem. Eur. J. Oper. Res. 9, 378\u2013385 (1982)","journal-title":"Eur. J. Oper. Res."},{"key":"205_CR11","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: An adaptive scheme to generate the Pareto front based on the epsilon-constraint method. In: Branke, J., Deb, K., Miettinen, K., Steuer, R.E. (eds.) Practical Approaches to Multi-Objective Optimization, number 04461 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, 2005. Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2005\/246"},{"key":"205_CR12","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.: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. Eur. J. Oper. Res. 169, 932\u2013942 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"205_CR13","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.: Finding all nondominated points of multi-objective integer programs. J. Global Optim. 57, 347\u2013365 (2013)","journal-title":"J. Global Optim."},{"key":"205_CR14","volume-title":"Nonlinear Multiobjective Optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer, Boston (1999)"},{"key":"205_CR15","doi-asserted-by":"crossref","unstructured":"Ozlen, M., Burton, B.A., MacRae, C.A.G.: Multi-objective integer programming: an improved recursive algorithm. J. Optim. Theory Appl. 160(2), 470\u2013482 (2014)","DOI":"10.1007\/s10957-013-0364-y"},{"key":"205_CR16","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.: Multi-objective integer programming: a general approach for generating all non-dominated solutions. Eur. J. Oper. Res. 199, 25\u201335 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"205_CR17","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.: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discrete Optim. 7, 149\u2013165 (2010)","journal-title":"Discrete Optim."},{"key":"205_CR18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10479-006-0058-z","volume":"147","author":"T Ralphs","year":"2006","unstructured":"Ralphs, T., Saltzman, M., Wiecek, M.M.: An improved algorithm for solving biobjective integer programs. Ann. Oper. Res. 147, 43\u201370 (2006)","journal-title":"Ann. Oper. Res."},{"issue":"10","key":"205_CR19","doi-asserted-by":"crossref","first-page":"1572","DOI":"10.1287\/mnsc.1050.0413","volume":"51","author":"S Say\u0131n","year":"2005","unstructured":"Say\u0131n, S., Kouvelis, P.: The multiobjective discrete optimization problem: a weighted min\u2013max two-stage optimization approach and a bicriteria algorithm. Manage. Sci. 51(10), 1572\u20131581 (2005)","journal-title":"Manage. Sci."},{"issue":"1","key":"205_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0305-0548(91)90037-R","volume":"18","author":"RS Solanki","year":"1991","unstructured":"Solanki, R.S.: Generating the noninferior set in mixed integer biobjective linear programs: an application to a location problem. Comput. Oper. Res. 18(1), 1\u201315 (1991)","journal-title":"Comput. Oper. Res."},{"key":"205_CR21","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/BF02591870","volume":"26","author":"RE Steuer","year":"1983","unstructured":"Steuer, R.E., Choo, E.: An interactive weighted Tchebycheff procedure for multiple objective programming. Math. Program. 26, 326\u2013344 (1983)","journal-title":"Math. Program."},{"key":"205_CR22","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.: A method for finding the set of non-dominated vectors for multiple objective integer linear programs. Eur. J. Oper. Res. 158, 46\u201355 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"205_CR23","unstructured":"Tenfelde-Podehl, D.: A recursive algorithm for multiobjective combinatorial optimization problems with $$Q$$ Q criteria. Technical Report. Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz (2003)"},{"issue":"2","key":"205_CR24","first-page":"149","volume":"20","author":"EL Ulungu","year":"1995","unstructured":"Ulungu, E.L., Teghem, J.: The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Found. Comput. Decis. Sci. 20(2), 149\u2013165 (1995)","journal-title":"Found. Comput. Decis. Sci."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0205-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0205-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0205-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:59:07Z","timestamp":1559278747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0205-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,22]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["205"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0205-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,22]]}}}