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.

How to Cite this Article

Raid Mansi, Cláudio Alves, J. M. Valério de Carvalho, and Saïd Hanafi, “An Exact Algorithm for Bilevel 0-1 Knapsack Problems,” Mathematical Problems in Engineering, vol. 2012, Article ID 504713, 23 pages, 2012. https://doi.org/10.1155/2012/504713.