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

An Auxiliary Function Method for Global Minimization in Integer Programming

School of Computer Science and Technology and Department of Applied Mathematics, School of Science, Xidian University, Xi'an, Shaanxi 710071, China

Received 22 July 2011; Revised 10 October 2011; Accepted 10 October 2011

Academic Editor: Blas M. Vinagre

Copyright © 2011 Hongwei Lin et al. 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. J. Bang-Jensen, G. Gutin, and A. Yeo, “When the greedy algorithm fails,” Discrete Optimization, vol. 1, no. 2, pp. 121–127, 2004. View at Publisher · View at Google Scholar
  2. V. Chvátal, “A greedy heuristic for the set-covering problem,” Mathematics of Operations Research, vol. 4, no. 3, pp. 233–235, 1979. View at Publisher · View at Google Scholar
  3. G. Dobson, “Worst-case analysis of greedy heuristics for integer programming with nonnegative data,” Mathematics of Operations Research, vol. 7, no. 4, pp. 515–531, 1982. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  4. A. Federgruen and H. Groenevelt, “The greedy procedure for resource allocation problems: necessary and sufficient conditions for optimality,” Operations Research, vol. 34, no. 6, p. 909–918 (1987), 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. C. Mohan and H. T. Nguyen, “A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems,” Computational Optimization and Applications, vol. 14, no. 1, pp. 103–132, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. S. L. Rosen and C. M. Harmonosky, “An improved simulated annealing simulation optimization method for discrete parameter stochastic systems,” Computers & Operations Research, vol. 32, no. 2, pp. 343–358, 2005. View at Google Scholar · View at Zentralblatt MATH
  7. J. Cai and G. Thierauf, “Evolution strategies for solving discrete optimization problems,” Advances in Engineering Software, vol. 25, no. 2-3, pp. 177–183, 1996. View at Publisher · View at Google Scholar · View at Scopus
  8. N. Turkkan, “Discrete optimization of structures using a floating-point genetic algorithm,” in Proceedings of the Annual Conference of the Canadian Society for Civil Engineering, Moncton, Canada, 2003. View at Publisher · View at Google Scholar
  9. S. J. Wu and P. T. Chow, “Steady-state genetic algorithms for discrete optimization of trusses,” Computers and Structures, vol. 56, no. 6, pp. 979–991, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. F. Glover, “Tabu search and adaptive memory programming C advances applications, and challenges,” in Interfaces in Computer Science and Operations Research: Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies, R. S. Barr, R. V. Helgason, and J. L. Kennington, Eds., pp. 1–75, Kluwer Academic Publishers, 1996. View at Google Scholar
  11. L. Michel and P. Van Hentenryck, “A simple tabu search for warehouse location,” European Journal of Operational Research, vol. 157, no. 3, pp. 576–591, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. S. F. Woon and V. Rehbock, “A critical review of discrete filled function methods in solving nonlinear discrete optimization problems,” Applied Mathematics and Computation, vol. 217, no. 1, pp. 25–41, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. Y. Shang and L. Zhang, “A filled function method for finding a global minimizer on global integer optimization,” Journal of Computational and Applied Mathematics, vol. 181, no. 1, pp. 200–210, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. C. K. Ng, D. Li, and L. S. Zhang, “Discrete global descent method for discrete global optimization and nonlinear integer programming,” Journal of Global Optimization, vol. 37, no. 3, pp. 357–379, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. Y. l. Shang and L. Zhang, “Finding discrete global minima with a filled function for integer programming,” European Journal of Operational Research, vol. 189, no. 1, pp. 31–40, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  16. Y. Yongjian and L. Yumei, “A new discrete filled function algorithm for discrete global optimization,” Journal of Computational and Applied Mathematics, vol. 202, no. 2, pp. 280–291, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. Y. Yang, Z. Wu, and F. Bai, “A filled function method for constrained nonlinear integer programming,” Journal of Industrial and Management Optimization, vol. 4, no. 2, pp. 353–362, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  18. Y. H. Gu and Z. Y. Wu, “A new filled function method for nonlinear integer programming problem,” Applied Mathematics and Computation, vol. 173, no. 2, pp. 938–950, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  19. C. K. Ng, L. S. Zhang, D. Li, and W. W. Tian, “Discrete filled function method for discrete global optimization,” Computational Optimization and Applications, vol. 31, no. 1, pp. 87–115, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH