{"id":"https://openalex.org/W7125249766","doi":"https://doi.org/10.15837/ijccc.2026.1.7267","title":"Solution Algorithm Involving Heuristics and Criterion Set Dissection to Solve Large Scale Multicriteria Knapsack Problems","display_name":"Solution Algorithm Involving Heuristics and Criterion Set Dissection to Solve Large Scale Multicriteria Knapsack Problems","publication_year":2026,"publication_date":"2026-01-21","ids":{"openalex":"https://openalex.org/W7125249766","doi":"https://doi.org/10.15837/ijccc.2026.1.7267"},"language":null,"primary_location":{"id":"doi:10.15837/ijccc.2026.1.7267","is_oa":true,"landing_page_url":"https://doi.org/10.15837/ijccc.2026.1.7267","pdf_url":"https://univagora.ro/jour/index.php/ijccc/article/download/7267/2414","source":{"id":"https://openalex.org/S147751515","display_name":"International Journal of Computers Communications & Control","issn_l":"1841-9836","issn":["1841-9836","1841-9844"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310314650","host_organization_name":"Agora University","host_organization_lineage":["https://openalex.org/P4310314650"],"host_organization_lineage_names":["Agora University"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://univagora.ro/jour/index.php/ijccc/article/download/7267/2414","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5116836177","display_name":"Nada Mladenovic","orcid":null},"institutions":[{"id":"https://openalex.org/I4068193","display_name":"University of Belgrade","ror":"https://ror.org/02qsmb048","country_code":"RS","type":"education","lineage":["https://openalex.org/I4068193"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Nada Mladenovic","raw_affiliation_strings":["Faculty of Organizational Sciences, University of Belgrade, Serbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Organizational Sciences, University of Belgrade, Serbia","institution_ids":["https://openalex.org/I4068193"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067516121","display_name":"Bogdana Stanojevi\u0107","orcid":"https://orcid.org/0000-0003-4524-5354"},"institutions":[{"id":"https://openalex.org/I4068193","display_name":"University of Belgrade","ror":"https://ror.org/02qsmb048","country_code":"RS","type":"education","lineage":["https://openalex.org/I4068193"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Bogdana Stanojevi\u0107","raw_affiliation_strings":["Faculty of Organizational Sciences, University of Belgrade, Serbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Organizational Sciences, University of Belgrade, Serbia","institution_ids":["https://openalex.org/I4068193"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4068193"],"apc_list":{"value":500,"currency":"EUR","value_usd":539},"apc_paid":{"value":500,"currency":"EUR","value_usd":539},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06192675,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.5637999773025513,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.5637999773025513,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.19830000400543213,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.03970000147819519,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8615999817848206},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7901999950408936},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.536899983882904},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5274999737739563},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4864000082015991},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4690999984741211},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4431999921798706}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8615999817848206},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7901999950408936},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.679099977016449},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5515999794006348},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.536899983882904},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5274999737739563},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4864000082015991},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4690999984741211},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4431999921798706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4422999918460846},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.41749998927116394},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.41019999980926514},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39500001072883606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36500000953674316},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.27469998598098755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.15837/ijccc.2026.1.7267","is_oa":true,"landing_page_url":"https://doi.org/10.15837/ijccc.2026.1.7267","pdf_url":"https://univagora.ro/jour/index.php/ijccc/article/download/7267/2414","source":{"id":"https://openalex.org/S147751515","display_name":"International Journal of Computers Communications & Control","issn_l":"1841-9836","issn":["1841-9836","1841-9844"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310314650","host_organization_name":"Agora University","host_organization_lineage":["https://openalex.org/P4310314650"],"host_organization_lineage_names":["Agora University"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.15837/ijccc.2026.1.7267","is_oa":true,"landing_page_url":"https://doi.org/10.15837/ijccc.2026.1.7267","pdf_url":"https://univagora.ro/jour/index.php/ijccc/article/download/7267/2414","source":{"id":"https://openalex.org/S147751515","display_name":"International Journal of Computers Communications & Control","issn_l":"1841-9836","issn":["1841-9836","1841-9844"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310314650","host_organization_name":"Agora University","host_organization_lineage":["https://openalex.org/P4310314650"],"host_organization_lineage_names":["Agora University"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W7125249766.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Multiobjective":[0],"combinatorial":[1,29,82],"optimization":[2,88],"is":[3,96],"an":[4,97],"essential":[5],"approach":[6,100,118,152],"for":[7],"handling":[8],"trade-offs":[9],"in":[10,46,143,169],"complex":[11],"control":[12],"and":[13,78,84,107,123],"communications":[14],"systems,":[15],"when":[16],"multiple":[17,128],"conflicting":[18],"objectives":[19],"(performance,":[20],"cost,":[21],"reliability)":[22],"must":[23],"be":[24,32],"counterbalanced.":[25],"Many":[26],"well":[27],"known":[28],"problems":[30,133,168],"can":[31],"easier":[33],"solved":[34],"by":[35,41],"customizing":[36],"a":[37],"general":[38,51,59],"approach,":[39],"namely":[40],"employing":[42],"problem":[43],"specific":[44],"algorithms":[45,89,122],"key":[47],"points":[48],"of":[49,71,75,81,116,165],"the":[50,58,66,72,86,104,114,117,121,136,144,147,150,154,162,166],"framework.":[52],"In":[53],"this":[54],"paper":[55,145],"we":[56,119],"adapt":[57],"framework":[60],"PESA":[61],"(2020)":[62],"from":[63,135],"continual":[64],"to":[65,156,161],"discrete":[67],"case":[68],"taking":[69],"advantage":[70],"particular":[73],"shapes":[74],"both":[76],"decision":[77],"criterion":[79],"space":[80],"problems,":[83],"replace":[85],"exact":[87],"with":[90],"new":[91],"developed":[92],"heuristics.":[93],"The":[94,138],"results":[95,141],"anytime":[98],"heuristics":[99],"that":[101,149],"progressively":[102],"dissecting":[103],"Pareto":[105,163],"front":[106],"deriving":[108],"approximated":[109],"non-dominated":[110],"points.":[111],"To":[112],"test":[113],"performances":[115],"customized":[120],"carried":[124],"out":[125],"experiments":[126],"on":[127],"criteria":[129],"multidimensional":[130],"0/1":[131],"Knapsack":[132],"recalled":[134],"literature.":[137],"comparative":[139],"numerical":[140],"reported":[142],"support":[146],"conclusion":[148],"novel":[151],"has":[153],"ability":[155],"generate":[157],"good":[158],"first-level":[159],"approximations":[160],"fronts":[164],"addressed":[167],"reasonable":[170],"time.":[171]},"counts_by_year":[],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2026-01-22T00:00:00"}