Exact solution approach for a class of nonlinear bilevel knapsack problems
From MaRDI portal
Publication:2018478
DOI10.1007/S10898-014-0189-8zbMATH Open1319.90053OpenAlexW2052697378WikidataQ57438682 ScholiaQ57438682MaRDI QIDQ2018478FDOQ2018478
Authors: 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
Recommendations
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- An exact algorithm for bilevel 0-1 knapsack problems
- Bilevel programming with knapsack constraints
- The bilevel knapsack problem with stochastic right-hand sides
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
Cites Work
- Title not available (Why is that?)
- The quadratic knapsack problem -- a survey
- Title not available (Why is that?)
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- An overview of bilevel optimization
- Title not available (Why is that?)
- Links between linear bilevel and mixed 0-1 programming problems
- Incorporating the threat of terrorist attacks in the design of public service facility networks
- Title not available (Why is that?)
- Pseudo-Boolean optimization
- Multilevel optimization: algorithms and applications
- Quadratic knapsack problems
- A dynamic programming algorithm for the bilevel Knapsack problem
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- A Complexity and Approximability Study of the Bilevel Knapsack Problem
- Bilevel programming with knapsack constraints
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- Two-stage quadratic integer programs with stochastic right-hand sides
- Sensitivity analysis for knapsack problems: A negative result
- An exact algorithm for bilevel 0-1 knapsack problems
- Checking local optimality in constrained quadratic programming is NP- hard
- Hyperbolic 0-1 programming and query optimization in information retrieval
- The bilevel knapsack problem with stochastic right-hand sides
Cited In (16)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- An exact algorithm for bilevel 0-1 knapsack problems
- The bilevel knapsack problem with stochastic right-hand sides
- Exact solution approaches for bilevel assignment problems
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
- Exact solution of a class of nonlinear knapsack problems
- A class of algorithms for mixed-integer bilevel min-max optimization
- Parametric Solution for Linear Bicriteria Knapsack Models
- Bilevel programming with knapsack constraints
- Sequential Shortest Path Interdiction with Incomplete Information
- Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function
- Solution techniques for bi-level knapsack problems
- A simple greedy heuristic for linear assignment interdiction
- On Bilevel Optimization with Inexact Follower
This page was built for publication: Exact solution approach for a class of nonlinear bilevel knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018478)
