{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T17:01:47Z","timestamp":1648832507130},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Info. Tech. Dec. Mak."],"published-print":{"date-parts":[[2013,1]]},"abstract":"<jats:p> In multiobjective linear programming, the weighted-sum functions can be used to characterize the entire set of efficient solutions, but in multiobjective combinatorial-{0,1} problems these functions can only determine a small subset of efficient solutions, called supported efficient solutions. In this paper, we show how the entire set of efficient solutions can be found with the same technique by modifying the original problem. An algorithm is proposed. Some results are presented and the effect of some parameters of the proposed algorithm is illustrated with the multiobjective {0,1}-knapsack problem. <\/jats:p>","DOI":"10.1142\/s0219622013500028","type":"journal-article","created":{"date-parts":[[2013,3,7]],"date-time":"2013-03-07T03:22:43Z","timestamp":1362626563000},"page":"27-44","source":"Crossref","is-referenced-by-count":3,"title":["USING WEIGHTED-SUM FUNCTIONS TO COMPUTE NONSUPPORTED EFFICIENT SOLUTIONS IN MULTIOBJECTIVE COMBINATORIAL-{0,1} PROBLEMS"],"prefix":"10.1142","volume":"12","author":[{"given":"CARLOS","family":"GOMES DA SILVA","sequence":"first","affiliation":[{"name":"School of Technology and Management, Polytechnic Institute of Leiria, Morro do Lena, Alto Vieiro, 2401-951 Leiria, Portugal"},{"name":"INESC-Coimbra, Rua Antero de Quental 199, 3000-033 Coimbra, Portugal"}]},{"given":"JO\u00c3O","family":"CL\u00cdMACO","sequence":"additional","affiliation":[{"name":"INESC-Coimbra, Rua Antero de Quental 199, 3000-033 Coimbra, Portugal"},{"name":"Faculty of Economics, University of Coimbra, Av. Dias da Silva, 165, 3004-512 Coimbra, Portugal"}]}],"member":"219","published-online":{"date-parts":[[2013,3,6]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/s002910000046"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02578918"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.1.189"},{"key":"rf4","volume-title":"Multiple Criteria Optimization: Theory, Computation and Application","author":"Steuer R.","year":"1986"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(93)90023-A"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00305-2"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(68)90201-1"},{"key":"rf8","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello S.","year":"1990"}],"container-title":["International Journal of Information Technology &amp; Decision Making"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219622013500028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:07:16Z","timestamp":1565186836000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219622013500028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":8,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2013,3,6]]},"published-print":{"date-parts":[[2013,1]]}},"alternative-id":["10.1142\/S0219622013500028"],"URL":"https:\/\/doi.org\/10.1142\/s0219622013500028","relation":{},"ISSN":["0219-6220","1793-6845"],"issn-type":[{"value":"0219-6220","type":"print"},{"value":"1793-6845","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}