Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3906 LNCS, Issue , 2006, Pages 1-12

  Armbruster, Michael ^a   Fügenschuh, Marzena ^b   Helmberg, Christoph ^a   Jetchev, Nikolay ^b   Martin, Alexander ^b  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING; SET THEORY;

LP-RELAXATION; MINIMUM GRAPH BISECTION PROBLEMS;

GENETIC ALGORITHMS;

EID: 33745786260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11730095_1     Document Type: Conference Paper

References (14)

1. Achterberg, T.: SCIP - a framework to integrate constraint and mixed integer programming. ZIB-Report (2004)
2. Armbruster, M., Fügenschuh, M., Helmberg, C., Jetchev, N., Martin, A.: LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. Operations Research Proceedings 2005 (to appear)
3. Banos, R., Gil, C., Ortega, J., Montoya, F. G.: Multilevel heuristic algorithm for graph partitioning. Proceedings of Applications of Evolutionary Computing, EvoWorkshops 2003. Springer, LNCS 2611 (2003) 143-153
4. Bui, T. N., Moon, B. R.: Genetic algorithm and graph partitioning. IEEE Trans. Comput. 45(7) (1996) 841-855
5. Ferreira, C. E., Martin, A., de Souza, C. C., Weismantel, R., Wolsey, L. A.: Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Programming 74 (1996) 247-267
6. Ferreira, C. E., Martin, A., de Souza, C. C., Weismantel, R., Wolsey, L. A.: The node capacitated graph partitioning problem: A computational study. Math. Programmming 81(2) (1998) 229-256
7. Garey, M. R., Johnson, D. S.: Computers and Intractability. W.H. Freeman and Company (1979)
8. Hoos, H. H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann (2004) San Francisco (CA)
9. Jünger, M., Martin, A., Reinelt, G., Weismantel, R.: Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Programmming B 63(3) (1994) 257-279
10. Kohmoto, K., Katayaman, K., Narihisa, H.: Performance of a genetic algorithm for the graph partitioning problem. Math. Comput. Modelling 38 (11-13) (2003) 1325-1333
11. Maini, H., Mehrotra, K., Mohan, C., Ranka, S.: Genetic algorithms for graph partitioning and incremental graph partitioning. Supercomputing '94: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994) 449-457, New York, USA, ACM Press.
12. Puchinger, J., Raidl, G. R.: Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, Springer LNCS 3562 (2005) 41-53
13. Soper, A.J., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J. Glob. Optim. 29(2) (2004) 225-241
14. ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. Information available at URL http://www.cplex.com.