Abstract | ||
---|---|---|
This paper defines a new combinatorial optimization problem, namely General Combinatorial Optimization Problem (GCOP), whose decision variables are a set of parametric algorithmic components, i.e. algorithm design decisions. The solutions of GCOP, i.e. compositions of algorithmic components, thus represent different generic search algorithms. The objective of GCOP is to find the optimal algorithmi... |
Year | DOI | Venue |
---|---|---|
2020 | 10.1109/MCI.2020.2976182 | IEEE Computational Intelligence Magazine |
Keywords | DocType | Volume |
Optimization,Heuristic algorithms,Alrogithm design and analysis,Portfolios,Search problems,Linear programming | Journal | 15 |
Issue | ISSN | Citations |
2 | 1556-603X | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rong Qu | 1 | 1963 | 88.55 |
Graham Kendall | 2 | 607 | 35.33 |
Nelishia Pillay | 3 | 237 | 33.72 |