List of Papers That Use Graph Benchmarks Based on Model RB

If you know any other paper that should be listed here, please send me an email.

• S. Cai, K. Su and Q. Chen. EWLS: A New Local Search for Minimum Vertex Cover. Proc. 24th AAAI, 2010.
• W. Pullan, F. Mascia and M. Brunato. Cooperating local search for the maximum clique problem. Journal of Heuristics, 2010.
• M. Khichane, P. Albert and C. Solnon. Strong Combination of Ant Colony Optimization with Constraint Programming Optimization. Proc. 7th CPAIOR, 2010.
• T.N. Bui, T. Nguyen, J.R. Rizzo. Parallel shared memory strategies for ant-based optimization algorithms. In Proc. GECCO 2009: 1-8.
• W. Pullan. Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers. Discrete Optimization 6(2009):214-219.
• J. Kratica, M. Cangalovic, V. Kovacevic-Vujcic. Computing minimal doubly resolving sets of graphs. Computers & Operations Research, 36 (2009) 2149-2159.
• J. Kratica, V. Kovacevic-Vujcic, M. Cangalovic. Computing the metric dimension of graphs by genetic algorithms. Computational Optimization and Applications, 44(2009) 343-361.
• S. Trulhanov. Novel approaches for solving large-scale optimization problems on graphs. Ph.D. Thesis, TAMU, 2008.
• P. Guturu, and R. Dantu. An Impatient Evolutionary Algorithm with Probabilistic Tabu Search for Unified Solution of Some NP Hard Problems in Graph and Set Theory via Clique Finding. IEEE Transactions on Systems, Man and Cybernetics, 28(2008):645-666.
• D.V. Andrade, M.G.C. Resende and R.F. Werneck. Fast local search for the maximum independent set problem. In: International Workshop on Experimental Algorithms (WEA), 2008.
• A. Grosso, M. Locatelli, W. J. Pullan. Simple ingredients leading to very efficient heuristics for the maximum clique problem. Journal of Heuristics, 14 (2008) 587-612.
• W. Pullan. Approximating the maximum vertex/edge weighted clique using local search. Journal of Heuristics, 14(2008):117-134.
• M. Pelikan, R. Kalapala, A.K. Hartmann. Hybrid evolutionary algorithms on minimum vertex cover for random graphs. GECCO 2007: 547-554.
• Y. Zhang, F. Yang and Y. Huang. A novel selection-learning algorithm for multi-satellite scheduling problems. IEEE Congress on Evolutionary Computation 2007: 1318-1324.
• H. Potrzebowski, J. Stanczak, K. Scep. Separable Decomposition of Graph Using a-cliques. Computer Recognition Systems 2 (Advances in Soft Computing), 2007.
• F. Brglez, J.A. Osborne. Performance testing of combinatorial solvers with isomorph class instances. In: Proceedings of the 2007 workshop on Experimental computer Science.
• S. Richter, M. Helmert and C. Gretton. A Stochastic Local Search Approach to Vertex Cover. In: Proceedings of the 30th German Conference on Artificial Intelligence (KI-2007), 2007.
• S. Gilmour and M. Dras. Exactness as Heuristic Structure for Guiding Ant Colony Optimization. Technical Report. Macquarie University, Department of Computing. Sydney, Australia, 2006.
• S. Gilmour and M. Dras. Kernelization as Heuristic Structure for the Vertex Cover Problem. Third Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS2006). Brussels, Belgium.