{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T04:25:04Z","timestamp":1781324704189,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,7,25]],"date-time":"2012-07-25T00:00:00Z","timestamp":1343174400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10898-012-9955-7","type":"journal-article","created":{"date-parts":[[2012,7,24]],"date-time":"2012-07-24T12:23:31Z","timestamp":1343132611000},"page":"347-365","source":"Crossref","is-referenced-by-count":75,"title":["Finding all nondominated points of multi-objective integer programs"],"prefix":"10.1007","volume":"57","author":[{"given":"Banu","family":"Lokman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Murat","family":"K\u00f6ksalan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,7,25]]},"reference":[{"key":"9955_CR1","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF00938448","volume":"45","author":"H.W. Corley","year":"1985","unstructured":"Corley H.W.: Efficient spanning trees. J. Optim. Theory Appl. 45, 481\u2013485 (1985)","journal-title":"J. Optim. Theory Appl."},{"key":"9955_CR2","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott M., Gandibleux X.: An annotated bibliography of multiobjective combinatorial optimization. OR Spektrum 22, 425\u2013460 (2000)","journal-title":"OR Spektrum"},{"issue":"1","key":"9955_CR3","first-page":"1","volume":"12","author":"M. Ehrgott","year":"2004","unstructured":"Ehrgott M., Gandibleux X.: Approximative solution methods for multiobjective combinatorial optimization. Sociedad de Estad\u00edstica e Investigaci\u00f3n Operativa 12(1), 1\u201389 (2004)","journal-title":"Sociedad de Estad\u00edstica e Investigaci\u00f3n Operativa"},{"issue":"7","key":"9955_CR4","doi-asserted-by":"crossref","first-page":"2292","DOI":"10.1016\/j.cor.2006.11.001","volume":"35","author":"C. Gomes da Silva","year":"2008","unstructured":"Gomes da Silva C., Cl\u00edmaco J., Figueira J.R.: Core problems in bi-criteria 0\u20131 knapsack problems. Comput. Oper. Res. 35(7), 2292\u20132306 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9955_CR5","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1023\/A:1012602011914","volume":"111","author":"F. Guerriero","year":"2001","unstructured":"Guerriero F., Musmanno R.: Label correcting methods to solve multicriteria shortest path problems. J. Optim. Theory Appl. 111(3), 589\u2013613 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"9955_CR6","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1002\/(SICI)1520-6750(199910)46:7<777::AID-NAV2>3.0.CO;2-5","volume":"46","author":"M.M. K\u00f6ksalan","year":"1999","unstructured":"K\u00f6ksalan M.M.: A heuristic approach to bicriteria scheduling. Nav. Res. Logist. 46, 777\u2013789 (1999)","journal-title":"Nav. Res. Logist."},{"key":"9955_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/nav.20336","volume":"56","author":"M. K\u00f6ksalan","year":"2009","unstructured":"K\u00f6ksalan M., Lokman B.: Approximating the nondominated frontiers of multi-objective combinatorial optimization problems. Nav. Res. Logist. 56, 191\u2013198 (2009)","journal-title":"Nav. Res. Logist."},{"key":"9955_CR8","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":"9955_CR9","unstructured":"Lokman, B.: Approaches for Multi-Objective Combinatorial Optimization Problems. Masters Thesis, Industrial Engineering Department, Middle East Technical University, Ankara (2007)"},{"key":"9955_CR10","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"E.Q.V. Martins","year":"1984","unstructured":"Martins E.Q.V.: On a multicriteria shortest path problem. Eur. J. Oper. Res. 16, 236\u2013245 (1984)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9955_CR11","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s10898-010-9552-6","volume":"49","author":"G. Mavrotas","year":"2011","unstructured":"Mavrotas G., Figueira J.R., Antoniadis A.: Using the idea of expanded core for the exact solution of bi-Objective multi-dimensional knapsack problems. J. Glob. Optim. 49(4), 589\u2013606 (2011)","journal-title":"J. Glob. Optim."},{"key":"9955_CR12","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.: Multi-criteria branch and bound: A vector maximization algorithm for mixed 0-1 multiple objective linear programming. Appl. Math. Comput. 171, 53\u201371 (2005)","journal-title":"Appl. Math. Comput."},{"key":"9955_CR13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ejor.2008.10.023","volume":"199","author":"M. \u00d6zlen","year":"2009","unstructured":"Azizo\u011flu 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":"9955_CR14","doi-asserted-by":"crossref","first-page":"1726","DOI":"10.1287\/mnsc.49.12.1726.25117","volume":"49","author":"S. Phelps","year":"2003","unstructured":"Phelps S., K\u00f6ksalan M.: An interactive evolutionary metaheuristic for multiobjective combinatorial optimization. Manag. Sci. 49, 1726\u20131738 (2003)","journal-title":"Manag. Sci."},{"key":"9955_CR15","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim R.C.: Shortest connection networks and some generations. Bell Syst. Tech. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"9955_CR16","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. Discret. Optim. 7(3), 149\u2013165 (2010)","journal-title":"Discret. Optim."},{"key":"9955_CR17","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/S0377-2217(97)00391-3","volume":"111","author":"R.M. Ramos","year":"1998","unstructured":"Ramos R.M., Alonso S., Sicilia J., Gonz\u00e1les C.: The problem of the optimal biobjective spanning tree. Eur. J. Oper. Res. 111, 617\u2013628 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9955_CR18","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.cor.2006.02.023","volume":"35","author":"S. Steiner","year":"2008","unstructured":"Steiner S., Radzik T.: Computing all efficient solutions of the biobjective minimum spanning tree problem. Comput. Oper. Res. 35(1), 198\u2013211 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9955_CR19","volume-title":"Multiple Criteria Optimization: Theory, Computation, and Application","author":"R.E. Steuer","year":"1986","unstructured":"Steuer R.E.: Multiple Criteria Optimization: Theory, Computation, and Application. Wiley, New York (1986)"},{"key":"9955_CR20","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 nondominated vectors for multiple objective integer linear programs. Eur. J. Oper. Res. 158, 46\u201355 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9955_CR21","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.ejor.2006.02.049","volume":"180","author":"J. Sylva","year":"2007","unstructured":"Sylva J., Crema A.: A method for finding well-dispersed subsets of nondominated vectors for multiple objective mixed integer linear programs. Eur. J. Oper. Res. 180, 1011\u20131027 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9955_CR22","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0377-2217(92)90248-8","volume":"62","author":"C.T. Tung","year":"1992","unstructured":"Tung C.T., Chew K.L.: A multicriteria pareto-optimal path algorithm. Eur. J. Oper. Res. 62, 203\u2013209 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"9955_CR23","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.0.CO;2-O","volume":"8","author":"E.L. Ulungu","year":"1999","unstructured":"Ulungu E.L., Teghem J., Fortemps P.H., Tuyttens D.: MOSA method: a tool for solving multiobjective combinatorial optimization problems. J. Multi-criteria Decis. Anal. 8, 221\u2013236 (1999)","journal-title":"J. Multi-criteria Decis. Anal."},{"key":"9955_CR24","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1008258310679","volume":"12","author":"M. Vis\u00e9e","year":"1998","unstructured":"Vis\u00e9e M., Teghem J., Pirlot M., Ulungu E.L.: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. J. Glob. Optim. 12, 139\u2013155 (1998)","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9955-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9955-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9955-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:59:03Z","timestamp":1559278743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9955-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,25]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9955"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9955-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,25]]}}}