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
Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Bilevel Integer Programs with Stochastic Right-Hand Sides, On Bilevel Optimization with Inexact Follower, The subset sum game revisited, Solution techniques for bi-level knapsack problems, A survey on bilevel optimization under uncertainty, An approximation scheme for a bilevel knapsack problem, A class of algorithms for mixed-integer bilevel min-max optimization, Approximation algorithms for a bi-level knapsack problem, On bilevel machine scheduling problems, Parametric integer programming algorithm for bilevel mixed integer programs, On exact solution approaches for bilevel quadratic 0-1 knapsack problem, A dynamic programming algorithm for the bilevel Knapsack problem, The bilevel knapsack problem with stochastic right-hand sides, Feature selection for classification models via bilevel optimization, An exact algorithm for bilevel 0-1 knapsack problems, Exact solution approach for a class of nonlinear bilevel knapsack problems, Knapsack problems -- an overview of recent advances. I: Single knapsack problems, The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective, Improved approximation algorithms for a bilevel knapsack problem, A polynomial algorithm for a continuous bilevel knapsack problem, A faster algorithm for the continuous bilevel knapsack problem, On a stochastic bilevel programming problem
