Local Metaheuristics and Graph Partitioning

[1]  Roberto Battiti,et al.  Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning , 1999, IEEE Trans. Computers.

[2]  Chris Walshaw,et al.  Multilevel Refinement for Combinatorial Optimisation Problems , 2004, Ann. Oper. Res..

[3]  L. Ingber.  Very fast simulated re-annealing , 1989 .

[4]  Lenwood S. Heath,et al.  An experimental evaluation of local search heuristics for graph partitioning , 1998, Computing.

[5]  Chris Walshaw,et al.  Multilevel mesh partitioning for heterogeneous communication networks , 2001, Future Gener. Comput. Syst..

[6]  Olivier C. Martin,et al.  Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..

[7]  G. R. Schreiber,et al.  Cut Size Statistics of Graph Bisection Heuristics , 1999, SIAM J. Optim..

[8]  André R. S. Amaral,et al.  An efficient approach for large scale graph partitioning , 2007, J. Comb. Optim..

[9]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  Charles-Edmond Bichot.  Metaheuristics for graph bisection , 2009, GECCO '09.

[12]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[13]  Shang-Hua Teng,et al.  How Good is Recursive Bisection? , 1997, SIAM J. Sci. Comput..

[14]  Julio Ortega Lopera,et al.  A Parallel Multilevel Metaheuristic for Graph Partitioning , 2004, J. Heuristics.

[15]  Roy D. Williams,et al.  Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991, Concurr. Pract. Exp..

[16]  Reinhard Lüling,et al.  Combining Helpful Sets and Parallel Simulated Annealing for the Graph-partitioning Problem , 1996, Parallel Algorithms Appl..

[17]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[18]  Julio Ortega,et al.  Multilevel Heuristic Algorithm for Graph Partitioning , 2003, EvoWorkshops.

[19]  Chris Walshaw,et al.  A Multilevel Approach to the Travelling Salesman Problem , 2002, Oper. Res..

[20]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[21]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[22]  Manuel Laguna,et al.  A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem , 1994, Oper. Res..