Integer Programming Formulation of the Bilevel Knapsack Problem
R. Mansi; S. Hanafi; L. Brotcorne
Mathematical Modelling of Natural Phenomena (2010)
- Volume: 5, Issue: 7, page 116-121
- ISSN: 0973-5348
Access Full Article
topAbstract
topHow to cite
topReferences
top- L. Brotcorne, S. Hanafi, R. Mansi. A dynamic programming algorithm for the bilevel knapsack problem. Operations Research Letters, 37 (2009), No. 3, 215–218.
- P. Calamai, L. Vicente. Generating linear and linear-quadratic Bilevel programming problems. SIAM Journal on Scientific and Statistical Computing, 14 (1993), 770–782.
- B. Colson, P. Marcotte, G. Savard. Bilevel programming, a survey. 4OR, 3 (2005), 87–107.
- S. Dempe. Foundation of Bilevel programming. Kluwer academic publishers, 2002.
- S. Dempe, K. Richter. Bilevel programming with Knapsack constraints. Central European Newspaper of Operations Research, 8 (2000), 93–107.
- P. Hansen, B. Jaumard, G. Savard. New branch-and-bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing, 13 (1992), 1194–1217.
- H. Kellerer, U. Pferschy, D. Pisinger. Knapsack problems. Springer-Verlag, 2004.
- J.T. Moore, J.F. Bard. The mixed integer linear Bilevel programming problem. Operations Research, 38 (1990), 911–921.