{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T01:32:46Z","timestamp":1769045566762,"version":"3.49.0"},"reference-count":0,"publisher":"Agora University of Oradea","issue":"1","license":[{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["INT J COMPUT COMMUN, Int. J. Comput. Commun. Control"],"abstract":"<jats:p>Multiobjective combinatorial optimization is an essential approach for handling trade-offs in complex control and communications systems, when multiple conflicting objectives (performance, cost, reliability) must be counterbalanced. Many well known combinatorial problems can be easier solved by customizing a general approach, namely by employing problem specific algorithms in key points of the general framework. In this paper we adapt the general framework PESA (2020) from continual to the discrete case taking advantage of the particular shapes of both decision and criterion space of combinatorial problems, and replace the exact optimization algorithms with new developed heuristics. The results is an anytime heuristics approach that progressively dissecting the Pareto front and deriving approximated non-dominated points. To test the performances of the approach we customized the algorithms and carried out experiments on multiple criteria multidimensional 0\/1 Knapsack problems recalled from the literature. The comparative numerical results reported in the paper support the conclusion that the novel approach has the ability to generate good first-level approximations to the Pareto fronts of the addressed problems in reasonable time.<\/jats:p>","DOI":"10.15837\/ijccc.2026.1.7267","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T10:53:39Z","timestamp":1768992819000},"source":"Crossref","is-referenced-by-count":0,"title":["Solution Algorithm Involving Heuristics and Criterion Set Dissection to Solve Large Scale Multicriteria Knapsack Problems"],"prefix":"10.15837","volume":"21","author":[{"given":"Nada","family":"Mladenovic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bogdana","family":"Stanojevi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"6528","published-online":{"date-parts":[[2026,1,21]]},"container-title":["INTERNATIONAL JOURNAL OF COMPUTERS  COMMUNICATIONS &amp; CONTROL"],"original-title":[],"deposited":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T10:53:40Z","timestamp":1768992820000},"score":1,"resource":{"primary":{"URL":"https:\/\/univagora.ro\/jour\/index.php\/ijccc\/article\/view\/7267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,21]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1,21]]}},"URL":"https:\/\/doi.org\/10.15837\/ijccc.2026.1.7267","relation":{},"ISSN":["1841-9844","1841-9836"],"issn-type":[{"value":"1841-9844","type":"electronic"},{"value":"1841-9836","type":"print"}],"subject":[],"published":{"date-parts":[[2026,1,21]]}}}