Advanced scatter search for the max-cut problem

INFORMS Journal on Computing

Volumn 21, Issue 1, 2009, Pages 26-38

  Martí, Rafael ^a   Duarte, Abraham ^b   Laguna, Manuel ^c  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSIDAD REY JUAN CARLOS   (Spain)

^c UNIVERSITY OF COLORADO   (United States)

Author keywords

Evolutionary algorithms; Max cut problem; Metaheuristics; Scatter search

Indexed keywords

EID: 67650002143     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0275     Document Type: Article

References (20)

1. Burer, S., R. D. C. Monteiro, Y. Zang. 2001. Rank-two relaxation heuristics for max-cut and other binary quadratic programs. SIAM J. Optim. 12 503-521.
2. Chang, K. C., D.-Z. Du. 1987. Eficient algorithms for layer assignment problems. IEEE Trans. Comput.-Aided Design 6 67-78.
3. Chen, R., Y. Kajitani, S. Chan. 1983. A graph-theoretic via minimization algorithm for two layer printed circuit boards. IEEE Trans. Circuits Systems 30 284-299.
4. Duarte, A., R. Martí. 2007. Tabu search and GRASP for the maximum diversity problem. Eur. J. Oper. Res. 178 71-84.
5. Festa, P., M. G. C. Resende. 2001. GRASP: An annotated bibliography. M. G. C. Resende, P. Hansen, eds. Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, Boston, 325-367.
6. Festa, P., P. M. Pardalos, M. G. C. Resende, C. C. Ribeiro. 2002. Randomized heuristics for the max-cut problem. Optim. Methods Software 7 1033-1058.
7. Glover, F. 1996. Ejection chains, reference structures and alternating methods for traveling salesman problems. Discrete Appl. Math.65 223-253.
8. Glover, F., M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Boston.
9. Goemans, M. X., D. P. Williamson. 1995. Improved approximation algorithms for the max-cut and satisfability problems using semidefinite programming. J. ACM 42 1115-1145.
10. Haglin, D. J., S. M. Venkatesen. 1991. Approximation and intractability results for the maximum cut problem and its variants. IEEE Trans. Comput. 40 110-113.
11. Helmberg, C., F. Rendl. 2000. A spectral bundle method for semidefinite programming. SIAM J. Optim. 10 673-696.
12. Homer, S., M. Peinado. 1997. Design and performance of parallel and distributed approximation algorithms for max cut. J. Parallel Distributed Comput. 46 48-61.
13. Karp, R. M. 1972. Reducibility among combinatorial problems. R. Miller, J. Tatchers, eds. Complexity of Computer Computations. Plenum Press, New York, 85-103.
14. Krishnan, K., J. E. Mitchell. 2006. A semidefinite programming based polyhedral cut and price approach for the maxcut problem. Comput. Optim. Appl. 33(1) 51-71.
15. Laguna, M., R. Martí. 1999. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 1144-52.
16. Laguna, M., R. Martí. 2003. Scatter Search: Methodology and Implementations in C. Kluwer Academic Publishers, Boston.
17. Lin, S., B. Kernighan. 1973. An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21 498-516.
18. Lovász, L. 1979. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory 25 1-7.
19. Poljak, S., Z. Tuza. 1982. A polynomial algorithm for constructing a large bipartite subgraph, with an application to a satisfiability problem. Canadian J. Math. 34 519-524.
20. Sahni, S., T. Gonzales. 1976. P-complete approximation problem. J. ACM 46 48-61.