4.5 Article

The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective

Related references

Note: Only part of the references are listed.
Article Operations Research & Management Science

Closing the gap in linear bilevel optimization: a new valid primal-dual inequality

Thomas Kleinert et al.

Summary: The paper explores linear bilevel optimization problems, introducing a new valid inequality that exploits the strong duality condition of the lower level and discussing strengthened variants derived from McCormick envelopes. Computational experiments demonstrate that the new valid inequalities can effectively close the optimality gap on a large test set of linear bilevel instances.

OPTIMIZATION LETTERS (2021)

Article Operations Research & Management Science

A faster algorithm for the continuous bilevel knapsack problem

Dennis Fischer et al.

OPERATIONS RESEARCH LETTERS (2020)

Article Operations Research & Management Science

On a class of bilevel linear mixed-integer programs in adversarial settings

M. Hosein Zare et al.

JOURNAL OF GLOBAL OPTIMIZATION (2018)

Article Operations Research & Management Science

A polynomial algorithm for a continuous bilevel knapsack problem

Margarida Carvalho et al.

OPERATIONS RESEARCH LETTERS (2018)

Article Operations Research & Management Science

Robust combinatorial optimization under convex and discrete cost uncertainty

Christoph Buchheim et al.

EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION (2018)

Article Operations Research & Management Science

Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function

Puchit Sariddichainunta et al.

ANNALS OF OPERATIONS RESEARCH (2017)

Article Operations Research & Management Science

Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear Constraints

T. D. Chuong et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2017)

Article Mathematics, Applied

A STUDY ON THE COMPUTATIONAL COMPLEXITY OF THE BILEVEL KNAPSACK PROBLEM

Alberto Caprara et al.

SIAM JOURNAL ON OPTIMIZATION (2014)

Article Mathematics, Applied

PESSIMISTIC BILEVEL OPTIMIZATION

Wolfram Wiesemann et al.

SIAM JOURNAL ON OPTIMIZATION (2013)

Article Engineering, Multidisciplinary

An Exact Algorithm for Bilevel 0-1 Knapsack Problems

Raid Mansi et al.

MATHEMATICAL PROBLEMS IN ENGINEERING (2012)

Article Operations Research & Management Science

The bilevel knapsack problem with stochastic right-hand sides

Osman Y. Ozaltin et al.

OPERATIONS RESEARCH LETTERS (2010)

Article Operations Research & Management Science

A dynamic programming algorithm for the bilevel knapsack problem

Luce Brotcorne et al.

OPERATIONS RESEARCH LETTERS (2009)

Review Operations Research & Management Science

An overview of bilevel optimization

Benoit Colson et al.

ANNALS OF OPERATIONS RESEARCH (2007)

Article Management

The price of robustness

D Bertsimas et al.

OPERATIONS RESEARCH (2004)

Article Mathematics, Applied

On the approximability of average completion time scheduling under precedence constraints

GJ Woeginger

DISCRETE APPLIED MATHEMATICS (2003)