Upper bounds and exact algorithms for p-dispersion problems
Computers and Operations Research
A heuristic approach for the max-min diversity problem based on max-clique
Computers and Operations Research
Variable neighborhood search for the heaviest k-subgraph
Computers and Operations Research
GRASP and path relinking for the max-min diversity problem
Computers and Operations Research
Competitive Hopfield network combined with estimation of distribution for maximum diversity problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Upper bounds and exact algorithms for p-dispersion problems
Computers and Operations Research
Transmitter location for maximum coverage and constructive-destructive interference management
Computers and Operations Research
Path-relinking intensification methods for stochastic local search algorithms
Journal of Heuristics
Heuristics and metaheuristics for the maximum diversity problem
Journal of Heuristics
| Hi-index | 0.00 |