Exact solution approach for a class of nonlinear bilevel knapsack problems

DOI10.1007/s10898-014-0189-8zbMath1319.90053OpenAlexW2052697378WikidataQ57438682 ScholiaQ57438682MaRDI QIDQ2018478

Yanyan Li

Publication date: 24 March 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-014-0189-8

zbMATH Keywords

integer programmingknapsack problemvalue functionsbilevel programming

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (7)

On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ A class of algorithms for mixed-integer bilevel min-max optimization ⋮ On Bilevel Optimization with Inexact Follower ⋮ Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function ⋮ A simple greedy heuristic for linear assignment interdiction ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-stage quadratic integer programs with stochastic right-hand sides
• Pseudo-Boolean optimization
• A dynamic programming algorithm for the bilevel Knapsack problem
• The quadratic knapsack problem -- a survey
• The bilevel knapsack problem with stochastic right-hand sides
• Checking local optimality in constrained quadratic programming is NP- hard
• Hyperbolic 0-1 programming and query optimization in information retrieval
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Practical bilevel optimization. Algorithms and applications
• Multilevel optimization: algorithms and applications
• Links between linear bilevel and mixed 0-1 programming problems
• Sensitivity analysis for knapsack problems: A negative result
• Foundations of bilevel programming
• Incorporating the threat of terrorist attacks in the design of public service facility networks
• One-level reformulation of the bilevel Knapsack problem using dynamic programming
• An exact algorithm for bilevel 0-1 knapsack problems
• An overview of bilevel optimization
• Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
• Quadratic knapsack problems
• A Complexity and Approximability Study of the Bilevel Knapsack Problem
• Bilevel programming with knapsack constraints

This page was built for publication: Exact solution approach for a class of nonlinear bilevel knapsack problems