Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012, Article ID 475018, 16 pages
http://dx.doi.org/10.1155/2012/475018
Research Article

A VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-Section

1Research Center of Security and Future, School of Finance, Jiangxi University of Finance and Economics, Nanchang 330013, China
2Key Laboratory of Management, Decision and Information Systems, Academy of Mathematics and Systems Science, CAS, Beijing 100190, China

Received 15 February 2012; Accepted 30 May 2012

Academic Editor: John Gunnar Carlsson

Copyright © 2012 Ai-fan Ling. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, R. Miller and J. Thatcher, Eds., pp. 85–103, Plenum Press, New York, NY, USA, 1972. View at Google Scholar
  2. M. R. Garey, D. S. Johnson, and L. Stockmeyer, “Some simplified NP-complete graph problems,” Theoretical Computer Science, vol. 1, no. 3, pp. 237–267, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. F. Barahona, M. Gröetschel, G. Reinelt, and M. Juenger, “An application of combinotiorial optimization to statistical physics and circuit layout design,” Operations Research, vol. 36, no. 3, pp. 493–513, 1988. View at Publisher · View at Google Scholar · View at Scopus
  4. M. X. Goemans and D. P. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” Journal of the Association for Computing Machinery, vol. 42, no. 6, pp. 1115–1145, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. A. Frieze and M. Jerrum, “Improved approximation algorithms for MAX k-CUT and MAX BISECTION,” in Integer Programming and Combinatorial Optimization, E. Balas and J. Clausen, Eds., vol. 920, pp. 1–13, 1995. View at Publisher · View at Google Scholar
  6. M. X. Goemans and D. P. Williamson, “Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming,” Journal of Computer and System Sciences, vol. 68, no. 2, pp. 442–470, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. S. Zhang and Y. Huang, “Complex quadratic optimization and semidefinite programming,” SIAM Journal on Optimization, vol. 16, no. 3, pp. 871–890, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  8. J. F. Sturm, “Using SeDuMi 1.02, ‘a MATLAB toolbox for optimization over symmetric cones’,” Optimization Methods and Software, vol. 11, no. 1–4, pp. 625–653, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. K.-C. Toh, M. J. Todd, and R. H. Tütüncü, “SDPT3 version 4.0 (beta)—a MATLAB software for semidefinite-quadratic-linear programming,” 2004, http://www.math.nus.edu.sg/~mattohkc/sdpt3.html.
  10. N. Mladenović and P. Hansen, “Variable neighborhood search,” Computers & Operations Research, vol. 24, no. 11, pp. 1097–1100, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. P. Hansen, N. Mladenović, and J. A. Moreno Pérez, “Variable neighbourhood search: methods and applications,” Annals of Operations Research, vol. 175, pp. 367–407, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. G. Andersson, “An approximation algorithm for Max p-Section,” Lecture Notes in Computer Science, vol. 1563, pp. 237–247, 1999. View at Publisher · View at Google Scholar
  13. D. R. Gaur, R. Krishnamurti, and R. Kohli, “The capacitated max k-cut problem,” Mathematical Programming, vol. 115, no. 1, pp. 65–72, 2008. View at Publisher · View at Google Scholar
  14. A.-F. Ling, “Approximation algorithms for Max 3-section using complex semidefinite programming relaxation,” in Combinatorial Optimization and Applications, vol. 5573 of Lecture Notes in Computer Science, pp. 219–230, 2009. View at Publisher · View at Google Scholar