An Optimal Strategy for the Constrained Cycle Cover Problem
Annals of Mathematics and Artificial Intelligence
Variable neighborhood search for the maximum clique
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
A study of ACO capabilities for solving the maximum clique problem
Journal of Heuristics
Computers and Operations Research
Case-based selection of initialisation heuristics for metaheuristic examination timetabling
Expert Systems with Applications: An International Journal
An approach for temporal analysis of email data based on segmentation
Data & Knowledge Engineering
Physician scheduling in emergency rooms
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Combinatorial algorithms for the maximum k-plex problem
Journal of Combinatorial Optimization
A novel similarity measure for heuristic selection in examination timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Parameterized algorithmics and computational experiments for finding 2-clubs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
An adaptive multistart tabu search approach to solve the maximum clique problem
Journal of Combinatorial Optimization
A branch-and-price algorithm for the robust graph coloring problem
Discrete Applied Mathematics
Algorithms for the maximum k-club problem in graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |