{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T09:31:28Z","timestamp":1775035888556,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T00:00:00Z","timestamp":1490313600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Funda\u00e7\u00e3o para a Ci\u011bncia e Tecnologia\/ Deutscher Akademischer Austausch Dienst"},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s11590-017-1129-6","type":"journal-article","created":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T11:41:14Z","timestamp":1490355674000},"page":"321-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Finding representations for an unconstrained bi-objective combinatorial optimization problem"],"prefix":"10.1007","volume":"12","author":[{"given":"Alexandre D.","family":"Jesus","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Paquete","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Rui","family":"Figueira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,24]]},"reference":[{"issue":"1","key":"1129_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.orl.2014.10.003","volume":"43","author":"C Bazgan","year":"2015","unstructured":"Bazgan, C., Jamain, F., Vanderpooten, D.: Approximate Pareto sets of minimal size for multi-objective optimization problems. Oper. Res. Lett. 43(1), 1\u20136 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1129_CR2","first-page":"232","volume-title":"Proceedngs of the 35rd Annual ACM Symposium on Theory of Computing (STOC)","author":"R Beier","year":"2003","unstructured":"Beier, R., V\u00f6cking, B.: Random knapsack in expected polynomial time. In: Larmore, L.L., Goemans, M.X. (eds.) Proceedngs of the 35rd Annual ACM Symposium on Theory of Computing (STOC), pp. 232\u2013241. ACM Press, New york (2003)"},{"issue":"2","key":"1129_CR3","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig, G.B.: Discrete-variable extremum problems. Oper. Res. 5(2), 266\u2013288 (1957)","journal-title":"Oper. Res."},{"issue":"4","key":"1129_CR4","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1137\/080724514","volume":"39","author":"I Diakonikolas","year":"2009","unstructured":"Diakonikolas, I., Yannakakis, M.: Small approximate Pareto sets for bi-objective shortest paths and other problems. SIAM J. Comput. 39(4), 1340\u20131371 (2009)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"1129_CR5","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1287\/mnsc.42.11.1565","volume":"42","author":"M Ebem-Chaime","year":"1996","unstructured":"Ebem-Chaime, M.: Parametric solution for linear bricriteria knapsack models. Manag. Sci. 42(11), 1565\u20131575 (1996)","journal-title":"Manag. Sci."},{"key":"1129_CR6","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)","edition":"2"},{"key":"1129_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2014.02.009","volume":"48","author":"A Eus\u00e9bio","year":"2014","unstructured":"Eus\u00e9bio, A., Figueira, J.R., Ehrgott, M.: On finding representative non-dominated points for bi-objective integer network flow problems. Comput. Oper. Res. 48, 1\u201310 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1129_CR8","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1162\/EVCO_a_00188","volume":"24","author":"AP Guerreiro","year":"2016","unstructured":"Guerreiro, A.P., Fonseca, C.M., Paquete, L.: Greedy hypervolume subset selection in low dimensions. Evol. Comput. 24(3), 521\u2013544 (2016)","journal-title":"Evol. Comput."},{"issue":"3","key":"1129_CR9","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 bicriterion optimization problems. Oper. Res. Lett. 35(3), 336\u2013344 (2007)","journal-title":"Oper. Res. Lett."},{"key":"1129_CR10","unstructured":"Jesus, A. D.: Implicit enumeration for representation systems in multiobjective optimization. Master\u2019s thesis, University of Coimbra, Portugal (2015)"},{"issue":"3","key":"1129_CR11","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1162\/EVCO_a_00157","volume":"24","author":"T Kuhn","year":"2016","unstructured":"Kuhn, T., Fonseca, C.M., Paquete, L., Ruzika, S., Duarte, M.M., Figueira, J.R.: Hypervolume subset selection in two dimensions: formulations and algorithms. Evol. Comput. 24(3), 411\u2013425 (2016)","journal-title":"Evol. Comput."},{"issue":"9","key":"1129_CR12","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1287\/mnsc.15.9.494","volume":"15","author":"G Nemhauser","year":"1969","unstructured":"Nemhauser, G., Ullman, Z.: Discrete dynamic programming and capital allocation. Manag. Sci. 15(9), 494\u2013505 (1969)","journal-title":"Manag. Sci."},{"key":"1129_CR13","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, FOCS \u201900, pp. 86\u201392, Washington, DC, USA, 2000. IEEE Computer Society","DOI":"10.1109\/SFCS.2000.892068"},{"issue":"3","key":"1129_CR14","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s101070050128","volume":"87","author":"S Say\u0131n","year":"2000","unstructured":"Say\u0131n, S.: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math. Program. 87(3), 543\u2013560 (2000)","journal-title":"Math. Program."},{"issue":"3","key":"1129_CR15","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/opre.51.3.427.14951","volume":"51","author":"S Say\u0131n","year":"2003","unstructured":"Say\u0131n, S.: A procedure to find discrete representations of the efficient set with specified coverage errors. Oper. Res. 51(3), 427\u2013436 (2003)","journal-title":"Oper. Res."},{"issue":"10","key":"1129_CR16","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-max two-stage optimization approach and a bicriteria algorithm. Manag. Sci. 51(10), 1572\u20131581 (2005)","journal-title":"Manag. Sci."},{"key":"1129_CR17","doi-asserted-by":"crossref","unstructured":"Serafini, P.: Some considerations about computational complexity for multiobjective combinatorial optimization. In: Recent Advances and Historical Development of Vector Optimization, Lecture Notes in Economics and Mathematics, pp. 221\u2013231, Berlin, Germany. Springer, Berlin (1986)","DOI":"10.1007\/978-3-642-46618-2_15"},{"key":"1129_CR18","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.cor.2015.05.003","volume":"63","author":"D Vaz","year":"2015","unstructured":"Vaz, D., Paquete, L., Fonseca, C.M., Klamroth, K., Stiglmayr, M.: Representation of the non-dominated set in biobjective discrete optimization. Comput. Oper. Res. 63, 172\u2013186 (2015)","journal-title":"Comput. Oper. Res."},{"key":"1129_CR19","doi-asserted-by":"crossref","unstructured":"Verel, S., Liefooghe, A., Jourdan, L., Dhaenens, C.: Analyzing the effect of objective correlation on the efficient set of MNK-landscapes. In: Proceedings of the 5th Conference on Learning and Intelligent OptimizatioN (LION 5), Lecture Notes in Computer Science, pp. 116\u2013130. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-25566-3_9"},{"key":"1129_CR20","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithmsa comparative case study. In: Proceedings of the International Conference on Parallel Problem Solving from Nature PPSN V, pp. 292\u2013301. Springer, Berlin (1998)","DOI":"10.1007\/BFb0056872"},{"issue":"2","key":"1129_CR21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1129-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1129-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1129-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T01:02:47Z","timestamp":1568941367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1129-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,24]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["1129"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1129-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,24]]}}}