Concepedia

One-level reformulation of the bilevel Knapsack problem using dynamic programming

Luce Brotcorne, Raïd Mansi

Discrete Optimization · 2012 · 41 citations · 12 references

DOIFull text

Open access

Concepts

References

12

New Branch-and-Bound Rules for Linear Bilevel Programming

Pierre Hansen, Brigitte Jaumard, Gilles Savard · SIAM Journal on Scientific and Statistical Computing · 1992 · 647 citations

, , +13

Mathematical Programs with Optimization Problems in the Constraints

Jerome Bracken, James T. McGill · Operations Research · 1973 · 537 citations

, , +15

Bilevel programming: A survey

Benoît Colson, Patrice Marcotte, Gilles Savard · 4OR · 2005 · 453 citations

, , +11

Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Silvano Martello, David Pisinger, Paolo Toth · Management Science · 1999 · 397 citations

, , +12

The Mixed Integer Linear Bilevel Programming Problem

James T. Moore, Jonathan F. Bard · Operations Research · 1990 · 354 citations

, , +16