Random-Key Metaheuristic and Linearization for the Quadratic Multiple Constraints Variable-Sized Bin Packing Problem Article Swipe
Santos, Natalia A.
,
Jeske, Marlon
,
Chaves, Antonio A.
·
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2511.12367
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2511.12367
This paper addresses the Quadratic Multiple Constraints Variable-Sized Bin Packing Problem (QMC-VSBPP), a challenging combinatorial optimization problem that generalizes the classical bin packing by incorporating multiple capacity dimensions, heterogeneous bin types, and quadratic interaction costs between items. We propose two complementary methods that advance the current state-of-the-art. First, a linearized mathematical formulation is introduced to eliminate quadratic terms, enabling the use of exact solvers such as Gurobi to compute strong lower bounds - reported here for the first time for this problem. Second, we develop RKO-ACO, a continuous-domain Ant Colony Optimization algorithm within the Random-Key Optimization framework, enhanced with adaptive Q-learning parameter control and efficient local search. Extensive computational experiments on benchmark instances show that the proposed linearized model produces significantly tighter lower bounds than the original quadratic formulation, while RKO-ACO consistently matches or improves upon all best-known solutions in the literature, establishing new upper bounds for large-scale instances. These results provide new reference values for future studies and demonstrate the effectiveness of evolutionary and random-key metaheuristic approaches for solving complex quadratic packing problems. Source code and data available at https://github.com/nataliaalves03/RKO-ACO
Related Topics
Concepts
Mathematical optimization
Metaheuristic
Bin packing problem
Linearization
Quadratic equation
Quadratic programming
Benchmark (surveying)
Mathematics
Quadratic assignment problem
Bin
Optimization problem
Sequential quadratic programming
Upper and lower bounds
Combinatorial optimization
Quadratically constrained quadratic program
Parallel metaheuristic
Computer science
Quadratic unconstrained binary optimization
Ant colony optimization algorithms
Algorithm
Extremal optimization
Local search (optimization)
Constraint (computer-aided design)
Ant colony
Quadratic function
Branch and bound
Heuristics
Metadata
- Type
- preprint
- Landing Page
- https://doi.org/10.48550/arxiv.2511.12367
- OA Status
- green
- OpenAlex ID
- https://openalex.org/W7106014949
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W7106014949Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2511.12367Digital Object Identifier
- Title
-
Random-Key Metaheuristic and Linearization for the Quadratic Multiple Constraints Variable-Sized Bin Packing ProblemWork title
- Type
-
preprintOpenAlex work type
- Publication year
-
2025Year of publication
- Publication date
-
2025-11-15Full publication date if available
- Authors
-
Santos, Natalia A., Jeske, Marlon, Chaves, Antonio A.List of authors in order
- Landing page
-
https://doi.org/10.48550/arxiv.2511.12367Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.48550/arxiv.2511.12367Direct OA link when available
- Concepts
-
Mathematical optimization, Metaheuristic, Bin packing problem, Linearization, Quadratic equation, Quadratic programming, Benchmark (surveying), Mathematics, Quadratic assignment problem, Bin, Optimization problem, Sequential quadratic programming, Upper and lower bounds, Combinatorial optimization, Quadratically constrained quadratic program, Parallel metaheuristic, Computer science, Quadratic unconstrained binary optimization, Ant colony optimization algorithms, Algorithm, Extremal optimization, Local search (optimization), Constraint (computer-aided design), Ant colony, Quadratic function, Branch and bound, HeuristicsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
Full payload
| id | https://openalex.org/W7106014949 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2511.12367 |
| ids.doi | https://doi.org/10.48550/arxiv.2511.12367 |
| ids.openalex | https://openalex.org/W7106014949 |
| fwci | 0.0 |
| type | preprint |
| title | Random-Key Metaheuristic and Linearization for the Quadratic Multiple Constraints Variable-Sized Bin Packing Problem |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C126255220 |
| concepts[0].level | 1 |
| concepts[0].score | 0.7186406254768372 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[0].display_name | Mathematical optimization |
| concepts[1].id | https://openalex.org/C109718341 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6677930355072021 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1385229 |
| concepts[1].display_name | Metaheuristic |
| concepts[2].id | https://openalex.org/C87219788 |
| concepts[2].level | 3 |
| concepts[2].score | 0.6609992384910583 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q814581 |
| concepts[2].display_name | Bin packing problem |
| concepts[3].id | https://openalex.org/C11210021 |
| concepts[3].level | 3 |
| concepts[3].score | 0.6454589366912842 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1520713 |
| concepts[3].display_name | Linearization |
| concepts[4].id | https://openalex.org/C129844170 |
| concepts[4].level | 2 |
| concepts[4].score | 0.6178369522094727 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q41299 |
| concepts[4].display_name | Quadratic equation |
| concepts[5].id | https://openalex.org/C81845259 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5766434669494629 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q290117 |
| concepts[5].display_name | Quadratic programming |
| concepts[6].id | https://openalex.org/C185798385 |
| concepts[6].level | 2 |
| concepts[6].score | 0.5382401943206787 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q1161707 |
| concepts[6].display_name | Benchmark (surveying) |
| concepts[7].id | https://openalex.org/C33923547 |
| concepts[7].level | 0 |
| concepts[7].score | 0.5265144109725952 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[7].display_name | Mathematics |
| concepts[8].id | https://openalex.org/C98036226 |
| concepts[8].level | 3 |
| concepts[8].score | 0.5218604803085327 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q7268356 |
| concepts[8].display_name | Quadratic assignment problem |
| concepts[9].id | https://openalex.org/C156273044 |
| concepts[9].level | 2 |
| concepts[9].score | 0.4793297052383423 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q4913766 |
| concepts[9].display_name | Bin |
| concepts[10].id | https://openalex.org/C137836250 |
| concepts[10].level | 2 |
| concepts[10].score | 0.4726499617099762 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q984063 |
| concepts[10].display_name | Optimization problem |
| concepts[11].id | https://openalex.org/C198927703 |
| concepts[11].level | 3 |
| concepts[11].score | 0.46727925539016724 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q4373881 |
| concepts[11].display_name | Sequential quadratic programming |
| concepts[12].id | https://openalex.org/C77553402 |
| concepts[12].level | 2 |
| concepts[12].score | 0.4499891996383667 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q13222579 |
| concepts[12].display_name | Upper and lower bounds |
| concepts[13].id | https://openalex.org/C52692508 |
| concepts[13].level | 2 |
| concepts[13].score | 0.4248807430267334 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q1333872 |
| concepts[13].display_name | Combinatorial optimization |
| concepts[14].id | https://openalex.org/C65148998 |
| concepts[14].level | 3 |
| concepts[14].score | 0.4049549996852875 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q7268373 |
| concepts[14].display_name | Quadratically constrained quadratic program |
| concepts[15].id | https://openalex.org/C28767586 |
| concepts[15].level | 4 |
| concepts[15].score | 0.37004774808883667 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q7135006 |
| concepts[15].display_name | Parallel metaheuristic |
| concepts[16].id | https://openalex.org/C41008148 |
| concepts[16].level | 0 |
| concepts[16].score | 0.3656221330165863 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[16].display_name | Computer science |
| concepts[17].id | https://openalex.org/C177179195 |
| concepts[17].level | 4 |
| concepts[17].score | 0.3586031198501587 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q7268372 |
| concepts[17].display_name | Quadratic unconstrained binary optimization |
| concepts[18].id | https://openalex.org/C40128228 |
| concepts[18].level | 2 |
| concepts[18].score | 0.3417140245437622 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q460851 |
| concepts[18].display_name | Ant colony optimization algorithms |
| concepts[19].id | https://openalex.org/C11413529 |
| concepts[19].level | 1 |
| concepts[19].score | 0.33969050645828247 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[19].display_name | Algorithm |
| concepts[20].id | https://openalex.org/C188919014 |
| concepts[20].level | 4 |
| concepts[20].score | 0.2994184195995331 |
| concepts[20].wikidata | https://www.wikidata.org/wiki/Q5422296 |
| concepts[20].display_name | Extremal optimization |
| concepts[21].id | https://openalex.org/C135320971 |
| concepts[21].level | 2 |
| concepts[21].score | 0.2922493815422058 |
| concepts[21].wikidata | https://www.wikidata.org/wiki/Q1868524 |
| concepts[21].display_name | Local search (optimization) |
| concepts[22].id | https://openalex.org/C2776036281 |
| concepts[22].level | 2 |
| concepts[22].score | 0.2765706777572632 |
| concepts[22].wikidata | https://www.wikidata.org/wiki/Q48769818 |
| concepts[22].display_name | Constraint (computer-aided design) |
| concepts[23].id | https://openalex.org/C60891933 |
| concepts[23].level | 3 |
| concepts[23].score | 0.2740751802921295 |
| concepts[23].wikidata | https://www.wikidata.org/wiki/Q796575 |
| concepts[23].display_name | Ant colony |
| concepts[24].id | https://openalex.org/C166437778 |
| concepts[24].level | 3 |
| concepts[24].score | 0.26990213990211487 |
| concepts[24].wikidata | https://www.wikidata.org/wiki/Q50695 |
| concepts[24].display_name | Quadratic function |
| concepts[25].id | https://openalex.org/C93693863 |
| concepts[25].level | 2 |
| concepts[25].score | 0.26822352409362793 |
| concepts[25].wikidata | https://www.wikidata.org/wiki/Q897659 |
| concepts[25].display_name | Branch and bound |
| concepts[26].id | https://openalex.org/C127705205 |
| concepts[26].level | 2 |
| concepts[26].score | 0.2524927258491516 |
| concepts[26].wikidata | https://www.wikidata.org/wiki/Q5748245 |
| concepts[26].display_name | Heuristics |
| keywords[0].id | https://openalex.org/keywords/metaheuristic |
| keywords[0].score | 0.6677930355072021 |
| keywords[0].display_name | Metaheuristic |
| keywords[1].id | https://openalex.org/keywords/bin-packing-problem |
| keywords[1].score | 0.6609992384910583 |
| keywords[1].display_name | Bin packing problem |
| keywords[2].id | https://openalex.org/keywords/linearization |
| keywords[2].score | 0.6454589366912842 |
| keywords[2].display_name | Linearization |
| keywords[3].id | https://openalex.org/keywords/quadratic-equation |
| keywords[3].score | 0.6178369522094727 |
| keywords[3].display_name | Quadratic equation |
| keywords[4].id | https://openalex.org/keywords/quadratic-programming |
| keywords[4].score | 0.5766434669494629 |
| keywords[4].display_name | Quadratic programming |
| keywords[5].id | https://openalex.org/keywords/benchmark |
| keywords[5].score | 0.5382401943206787 |
| keywords[5].display_name | Benchmark (surveying) |
| keywords[6].id | https://openalex.org/keywords/quadratic-assignment-problem |
| keywords[6].score | 0.5218604803085327 |
| keywords[6].display_name | Quadratic assignment problem |
| keywords[7].id | https://openalex.org/keywords/bin |
| keywords[7].score | 0.4793297052383423 |
| keywords[7].display_name | Bin |
| keywords[8].id | https://openalex.org/keywords/optimization-problem |
| keywords[8].score | 0.4726499617099762 |
| keywords[8].display_name | Optimization problem |
| language | |
| locations[0].id | doi:10.48550/arxiv.2511.12367 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | cc-by |
| locations[0].pdf_url | |
| locations[0].version | |
| locations[0].raw_type | article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | False |
| locations[0].is_published | |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | https://doi.org/10.48550/arxiv.2511.12367 |
| indexed_in | datacite |
| authorships[0].author.id | |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Santos, Natalia A. |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Santos, Natalia A. |
| authorships[0].is_corresponding | True |
| authorships[1].author.id | |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Jeske, Marlon |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Jeske, Marlon |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Chaves, Antonio A. |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Chaves, Antonio A. |
| authorships[2].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.48550/arxiv.2511.12367 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-11-19T00:00:00 |
| display_name | Random-Key Metaheuristic and Linearization for the Quadratic Multiple Constraints Variable-Sized Bin Packing Problem |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-19T23:39:43.309859 |
| primary_topic | |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.48550/arxiv.2511.12367 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | |
| best_oa_location.version | |
| best_oa_location.raw_type | article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | https://doi.org/10.48550/arxiv.2511.12367 |
| primary_location.id | doi:10.48550/arxiv.2511.12367 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | cc-by |
| primary_location.pdf_url | |
| primary_location.version | |
| primary_location.raw_type | article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | https://doi.org/10.48550/arxiv.2511.12367 |
| publication_date | 2025-11-15 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.- | 72 |
| abstract_inverted_index.a | 12, 48, 86 |
| abstract_inverted_index.We | 37 |
| abstract_inverted_index.as | 65 |
| abstract_inverted_index.at | 179 |
| abstract_inverted_index.by | 23 |
| abstract_inverted_index.in | 139 |
| abstract_inverted_index.is | 52 |
| abstract_inverted_index.of | 61, 162 |
| abstract_inverted_index.on | 110 |
| abstract_inverted_index.or | 133 |
| abstract_inverted_index.to | 54, 67 |
| abstract_inverted_index.we | 83 |
| abstract_inverted_index.Ant | 88 |
| abstract_inverted_index.Bin | 8 |
| abstract_inverted_index.all | 136 |
| abstract_inverted_index.and | 31, 103, 158, 164, 176 |
| abstract_inverted_index.bin | 21, 29 |
| abstract_inverted_index.for | 75, 79, 146, 155, 168 |
| abstract_inverted_index.new | 143, 152 |
| abstract_inverted_index.the | 3, 19, 44, 59, 76, 93, 115, 125, 140, 160 |
| abstract_inverted_index.two | 39 |
| abstract_inverted_index.use | 60 |
| abstract_inverted_index.This | 0 |
| abstract_inverted_index.code | 175 |
| abstract_inverted_index.data | 177 |
| abstract_inverted_index.here | 74 |
| abstract_inverted_index.show | 113 |
| abstract_inverted_index.such | 64 |
| abstract_inverted_index.than | 124 |
| abstract_inverted_index.that | 17, 42, 114 |
| abstract_inverted_index.this | 80 |
| abstract_inverted_index.time | 78 |
| abstract_inverted_index.upon | 135 |
| abstract_inverted_index.with | 98 |
| abstract_inverted_index.These | 149 |
| abstract_inverted_index.costs | 34 |
| abstract_inverted_index.exact | 62 |
| abstract_inverted_index.first | 77 |
| abstract_inverted_index.local | 105 |
| abstract_inverted_index.lower | 70, 122 |
| abstract_inverted_index.model | 118 |
| abstract_inverted_index.paper | 1 |
| abstract_inverted_index.upper | 144 |
| abstract_inverted_index.while | 129 |
| abstract_inverted_index.Colony | 89 |
| abstract_inverted_index.First, | 47 |
| abstract_inverted_index.Gurobi | 66 |
| abstract_inverted_index.Source | 174 |
| abstract_inverted_index.bounds | 71, 123, 145 |
| abstract_inverted_index.future | 156 |
| abstract_inverted_index.items. | 36 |
| abstract_inverted_index.strong | 69 |
| abstract_inverted_index.terms, | 57 |
| abstract_inverted_index.types, | 30 |
| abstract_inverted_index.values | 154 |
| abstract_inverted_index.within | 92 |
| abstract_inverted_index.Packing | 9 |
| abstract_inverted_index.Problem | 10 |
| abstract_inverted_index.RKO-ACO | 130 |
| abstract_inverted_index.Second, | 82 |
| abstract_inverted_index.advance | 43 |
| abstract_inverted_index.between | 35 |
| abstract_inverted_index.complex | 170 |
| abstract_inverted_index.compute | 68 |
| abstract_inverted_index.control | 102 |
| abstract_inverted_index.current | 45 |
| abstract_inverted_index.develop | 84 |
| abstract_inverted_index.matches | 132 |
| abstract_inverted_index.methods | 41 |
| abstract_inverted_index.packing | 22, 172 |
| abstract_inverted_index.problem | 16 |
| abstract_inverted_index.propose | 38 |
| abstract_inverted_index.provide | 151 |
| abstract_inverted_index.results | 150 |
| abstract_inverted_index.search. | 106 |
| abstract_inverted_index.solvers | 63 |
| abstract_inverted_index.solving | 169 |
| abstract_inverted_index.studies | 157 |
| abstract_inverted_index.tighter | 121 |
| abstract_inverted_index.Multiple | 5 |
| abstract_inverted_index.RKO-ACO, | 85 |
| abstract_inverted_index.adaptive | 99 |
| abstract_inverted_index.capacity | 26 |
| abstract_inverted_index.enabling | 58 |
| abstract_inverted_index.enhanced | 97 |
| abstract_inverted_index.improves | 134 |
| abstract_inverted_index.multiple | 25 |
| abstract_inverted_index.original | 126 |
| abstract_inverted_index.problem. | 81 |
| abstract_inverted_index.produces | 119 |
| abstract_inverted_index.proposed | 116 |
| abstract_inverted_index.reported | 73 |
| abstract_inverted_index.Extensive | 107 |
| abstract_inverted_index.Quadratic | 4 |
| abstract_inverted_index.addresses | 2 |
| abstract_inverted_index.algorithm | 91 |
| abstract_inverted_index.available | 178 |
| abstract_inverted_index.benchmark | 111 |
| abstract_inverted_index.classical | 20 |
| abstract_inverted_index.efficient | 104 |
| abstract_inverted_index.eliminate | 55 |
| abstract_inverted_index.instances | 112 |
| abstract_inverted_index.parameter | 101 |
| abstract_inverted_index.problems. | 173 |
| abstract_inverted_index.quadratic | 32, 56, 127, 171 |
| abstract_inverted_index.reference | 153 |
| abstract_inverted_index.solutions | 138 |
| abstract_inverted_index.Q-learning | 100 |
| abstract_inverted_index.Random-Key | 94 |
| abstract_inverted_index.approaches | 167 |
| abstract_inverted_index.best-known | 137 |
| abstract_inverted_index.framework, | 96 |
| abstract_inverted_index.instances. | 148 |
| abstract_inverted_index.introduced | 53 |
| abstract_inverted_index.linearized | 49, 117 |
| abstract_inverted_index.random-key | 165 |
| abstract_inverted_index.Constraints | 6 |
| abstract_inverted_index.challenging | 13 |
| abstract_inverted_index.demonstrate | 159 |
| abstract_inverted_index.dimensions, | 27 |
| abstract_inverted_index.experiments | 109 |
| abstract_inverted_index.formulation | 51 |
| abstract_inverted_index.generalizes | 18 |
| abstract_inverted_index.interaction | 33 |
| abstract_inverted_index.large-scale | 147 |
| abstract_inverted_index.literature, | 141 |
| abstract_inverted_index.(QMC-VSBPP), | 11 |
| abstract_inverted_index.Optimization | 90, 95 |
| abstract_inverted_index.consistently | 131 |
| abstract_inverted_index.establishing | 142 |
| abstract_inverted_index.evolutionary | 163 |
| abstract_inverted_index.formulation, | 128 |
| abstract_inverted_index.mathematical | 50 |
| abstract_inverted_index.optimization | 15 |
| abstract_inverted_index.combinatorial | 14 |
| abstract_inverted_index.complementary | 40 |
| abstract_inverted_index.computational | 108 |
| abstract_inverted_index.effectiveness | 161 |
| abstract_inverted_index.heterogeneous | 28 |
| abstract_inverted_index.incorporating | 24 |
| abstract_inverted_index.metaheuristic | 166 |
| abstract_inverted_index.significantly | 120 |
| abstract_inverted_index.Variable-Sized | 7 |
| abstract_inverted_index.continuous-domain | 87 |
| abstract_inverted_index.state-of-the-art. | 46 |
| abstract_inverted_index.https://github.com/nataliaalves03/RKO-ACO | 180 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile |