Bilevel programming with knapsack constraints
From MaRDI portal
Publication:5949871
zbMath0981.90058MaRDI QIDQ5949871
Publication date: 5 December 2001
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Related Items (23)
On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ On a stochastic bilevel programming problem ⋮ A dynamic programming algorithm for the bilevel Knapsack problem ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ A class of algorithms for mixed-integer bilevel min-max optimization ⋮ The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective ⋮ Bilevel Integer Programs with Stochastic Right-Hand Sides ⋮ A faster algorithm for the continuous bilevel knapsack problem ⋮ Approximation algorithms for a bi-level knapsack problem ⋮ A polynomial algorithm for a continuous bilevel knapsack problem ⋮ Solution techniques for bi-level knapsack problems ⋮ A survey on bilevel optimization under uncertainty ⋮ An approximation scheme for a bilevel knapsack problem ⋮ On bilevel machine scheduling problems ⋮ On Bilevel Optimization with Inexact Follower ⋮ An exact algorithm for bilevel 0-1 knapsack problems ⋮ Feature selection for classification models via bilevel optimization ⋮ Parametric integer programming algorithm for bilevel mixed integer programs ⋮ Exact solution approach for a class of nonlinear bilevel knapsack problems ⋮ The bilevel knapsack problem with stochastic right-hand sides ⋮ The subset sum game revisited ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Improved approximation algorithms for a bilevel knapsack problem
This page was built for publication: Bilevel programming with knapsack constraints
