Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2011, Article ID 218078, 11 pages
http://dx.doi.org/10.1155/2011/218078
Research Article

A Heuristic Algorithm for Resource Allocation/Reallocation Problem

Department of Mathematics, School of Humanities & Sciences, SASTRA University, Tamil Nadu, Thanjavur 613401, India

Received 3 February 2011; Revised 16 June 2011; Accepted 19 July 2011

Academic Editor: Yuri Sotskov

Copyright © 2011 S. Raja Balachandar and K. Kannan. 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. Parra-Hernández and N. Dimopoulos, “Channel resource allocation/reallocation in cellular communication and linear programming,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, vol. 3, pp. 2983–2989, October 2003.
  2. S. Khan, Quality adaptation in a multi-session adaptive multimedia system: model and architecture, Ph.D. dissertation, University of Victoria, Victoria, Canada, 1998.
  3. M. Moser, D. P. Jokanovic, and N. Shiratori, “An algorithm for the multidimensional multichoice knapsack problem,” IEICE Trans Fundam Electron, vol. 80, no. 3, pp. 582–589, 1997. View at Google Scholar
  4. S. Khan, K. F. Li, E. G. Manning, and M. D. M. Akbar, “Solving the Knapsack problem for adaptive multimedia systems,” Studia Informatica, vol. 2, pp. 154–174, 2002. View at Google Scholar
  5. Y. Toyoda, “A simplified algorithm for obtaining approximate solutions to zero-one programming problems,” Management Science, vol. 21, no. 12, pp. 1417–1427, 1974/75. View at Google Scholar
  6. M. M. Akbar, E. G. Manning, G. C. Shoja, and S. Khan, “Heuristic solutions for the multiple-choice multi-dimension knapsack problem,” in the International Conference on Computional Science, V. N. Alexandrov, J. Dongarra, B. A. Juliano, R. S. Renner, C. Jeng, and K. Tan, Eds., Lecture Notes in Computer Science, pp. 659–668, San Francisco, Calif, USA, May 2001.
  7. M Hifi, M Micharfy, and A Sbihi, “Heuristic algorithms for the multiple-choice multi-dimensional knapsack problem,” Journal of the Operational Research Society, vol. 55, no. 12, pp. 1323–1332, 2004. View at Google Scholar
  8. M. Hifi, M. Michrafy, and A. Sbihi, “A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem,” Computational Optimization and Applications, vol. 33, no. 2-3, pp. 271–285, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. N. Cherfi and M. Hifi, “Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem,” International Journal of Operational Research, vol. 5, no. 1, pp. 89–109, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. N. Cherfi and M. Hifi, “A column generation method for the multiple-choice multi-dimensional knapsack problem,” Computational Optimization and Applications, vol. 46, no. 1, pp. 51–73, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. A. Drexl, “A simulated annealing approach to the multiconstraint zero-one knapsack problem,” Computing, vol. 40, no. 1, pp. 1–8, 1988. View at Publisher · View at Google Scholar · View at MathSciNet
  12. R. Parra-Hernández and N. J. Dimopoulos, “A new heuristic for solving the multichoice multidimensional knapsack problem,” IEEE Transactions on Systems, Man, and Cybernetics Part A, vol. 35, no. 5, pp. 708–717, 2005. View at Publisher · View at Google Scholar
  13. M. A. H. Newton, M. W. H. Sadid, and M. M. Akbar, “A parallel heuristic algorithm for multiple-choice multidimensional knapsack problem,” in the International Conference on Computer and Information Technology, pp. 181–184, Dhaka, Bangladesh, December 2003.
  14. A. Z. M. Shahriar, M. M. Akbar, M. S. Rahman, and M. A. H. Newton, “A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem,” Journal of Supercomputing, vol. 43, no. 3, pp. 257–280, 2008. View at Publisher · View at Google Scholar
  15. A. Sbihi, “A best first search exact algorithm for the multiple-choice multidimensional knapsack problem,” Journal of Combinatorial Optimization, vol. 13, no. 4, pp. 337–351, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. S. Raja Balachandar and K. Kannan, “A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles,” Applied Mathematics and Computation, vol. 202, no. 1, pp. 71–77, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. A. L. Brearley, G. Mitra, and H. P. Williams, “Analysis of mathematical programming problems prior to applying the simplex algorithm,” Mathematical Programming, vol. 8, pp. 54–83, 1975. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  18. J. Gondzio, “Presolve analysis of linear programs prior to applying an interior point method,” INFORMS Journal on Computing, vol. 9, no. 1, pp. 73–91, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  19. I. Ioslovich, “Robust reduction of a class of large-scale linear programs,” SIAM Journal on Optimization, vol. 12, no. 1, pp. 262–282, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. M. H. Karwan, V. Lotfi, J. Telgen, and S. Zionts, Redundancy in Mathematical Programming: A State-of-the-Art Survey, vol. 206 of Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, Germany, 1983.
  21. T. H. Mattheiss, “An algorithm for determining irrelevant constraints and all verticles in systems of linear inequalities,” Operations Research, vol. 21, pp. 247–260, 1973. View at Publisher · View at Google Scholar
  22. Cs. Mészáros and U. H. Suhl, “Advanced preprocessing techniques for linear and quadratic programming,” Spectrum, vol. 25, no. 4, pp. 575–595, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. N. V. Stojković and P. S. Stanimirović, “Two direct methods in linear programming,” European Journal of Operational Research, vol. 131, no. 2, pp. 417–439, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. J. Telgen, “Identifying redundant constraints and implicit equalities in systems of linear constraints,” Management Science, vol. 29, no. 10, pp. 1209–1222, 1983. View at Google Scholar · View at Zentralblatt MATH
  25. J. A. Tomlin and J. S. Welch, “Finding duplicate rows in a linear programming model,” Operations Research Letters, vol. 5, no. 1, pp. 7–11, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. S. Paulraj, C. Chellappan, and T. R. Natesan, “A heuristic approach for identification of redundant constraints in linear programming models,” International Journal of Computer Mathematics, vol. 83, no. 8-9, pp. 675–683, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet