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

An Exact Algorithm for Bilevel 0-1 Knapsack Problems

1Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia, Universidade do Minho, 4710-057 Braga, Portugal
2Departamento de Produção e Sistemas, Universidade do Minho, 4710-057 Braga, Portugal
3LAMIH-SIADE, UMR 8530, Université de Valenciennes et du Hainaut-Cambrésis, Le Mont Houy, 59313 Valenciennes Cedex 9, France

Received 5 August 2011; Revised 26 October 2011; Accepted 31 October 2011

Academic Editor: Piermarco Cannarsa

Copyright © 2012 Raid Mansi 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. Bracken and J. T. McGill, “Mathematical programs with optimization problems in the constraints,” Operations Research, vol. 21, pp. 37–44, 1973. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. H. Stackelberg, The Theory of the Market Economy, Oxford University Press, Oxford, UK, 1952.
  3. K. Shimizu, Y. Ishizuka, and J. F. Bard, Nondifferentiable and Two-Level Mathematical Programming, Kluwer Academic, 1996.
  4. S. Dempe, Foundations of Bilevel Programming, vol. 61, Kluwer Academic, Dordrecht, The Netherlands, 2002.
  5. B. Colson, P. Marcotte, and G. Savard, “Bilevel programming: a survey,” Quarterly Journal of the Belgian, vol. 3, no. 2, pp. 87–107, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. S. Dempe and K. Richter, “Bilevel programming with knapsack constraints,” Central European Journal of Operations Research, vol. 8, no. 2, pp. 93–107, 2000. View at Google Scholar · View at Zentralblatt MATH
  7. A. Plyasunov, “The bilevel optimization problem with multiple-choice knapsack problem in lower level,” Discrete Analysis and Research Operations, vol. 10, pp. 44–52, 2003. View at Google Scholar
  8. L. Brotcorne, S. Hanafi, and R. Mansi, “A dynamic programming algorithm for the bilevel knapsack problem,” Operations Research Letters, vol. 37, no. 3, pp. 215–218, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. J. T. Moore and J. F. Bard, “The mixed integer linear bilevel programming problem,” Operations Research, vol. 38, no. 5, pp. 911–921, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. L. Brotcorne, S. Hanafi, and R. Mansi, “One-level reformulation of the bilevel knapsack problem using dynamic programming,” Tech. Rep., Université de Valenciennes et du Hainaut-Cambrésis, France, 2011. View at Google Scholar
  11. S. Dempe, “Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints,” Optimization, vol. 52, no. 3, pp. 333–359, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. O. Marcotte and G. Savard, Bilevel Programming: Applications, Kluwer Academic, Dordrecht, The Netherlands, 2001.
  13. S. Kosuch, P. Le Bodic, J. Leung, and A. Lisser, “On a stochastic bilevel programming problem with knapsack constraints,” in Proceedings of the International Network Optimization Conference, 2009. View at Publisher · View at Google Scholar
  14. J. F. Bard and J. T. Moore, “An algorithm for the discrete bilevel programming problem,” Naval Research Logistics, vol. 39, no. 3, pp. 419–435, 1992. View at Google Scholar · View at Zentralblatt MATH
  15. P. Loridan and J. Morgan, “Weak via strong Stackelberg problem: new results,” Journal of Global Optimization, vol. 8, no. 3, pp. 263–287, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  16. T. A. Edmunds and J. F. Bard, “Algorithms for nonlinear bilevel mathematical programs,” IEEE Transactions on Systems, Man and Cybernetics, vol. 21, no. 1, pp. 83–89, 1991. View at Publisher · View at Google Scholar
  17. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, John Wiley and Sons, New York, NY, USA, 1990.
  18. E. Balas and C. H. Martin, “Pivot and complement-a heuristic for 0-1 programming,” Management Science, vol. 26, no. 1, pp. 86–96, 1980. View at Google Scholar · View at Zentralblatt MATH
  19. D. Fayard and G. Plateau, “An algorithm for the solution of the 0-1 knapsack problem,” Computing, vol. 33, no. 5, pp. 1259–1273, 2006. View at Publisher · View at Google Scholar
  20. B. Gavish and H. Pirkul, “Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality,” Mathematical Programming, vol. 31, no. 1, pp. 78–105, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  21. S. Martello, D. Pisinger, and P. Toth, “Dynamic programming and strong bounds for the 0-1 knapsack problem,” Management Science, vol. 45, no. 3, pp. 414–424, 1999. View at Publisher · View at Google Scholar · View at Scopus