Exact solution approach for a class of nonlinear bilevel knapsack problems
From MaRDI portal
Publication:2018478
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
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1163110 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A complexity and approximability study of the bilevel knapsack problem
- A dynamic programming algorithm for the bilevel Knapsack problem
- An exact algorithm for bilevel 0-1 knapsack problems
- An overview of bilevel optimization
- Bilevel programming with knapsack constraints
- Checking local optimality in constrained quadratic programming is NP- hard
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Foundations of bilevel programming
- Hyperbolic 0-1 programming and query optimization in information retrieval
- Incorporating the threat of terrorist attacks in the design of public service facility networks
- Links between linear bilevel and mixed 0-1 programming problems
- Multilevel optimization: algorithms and applications
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- Practical bilevel optimization. Algorithms and applications
- Pseudo-Boolean optimization
- Quadratic knapsack problems
- Sensitivity analysis for knapsack problems: A negative result
- The bilevel knapsack problem with stochastic right-hand sides
- The quadratic knapsack problem -- a survey
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- Two-stage quadratic integer programs with stochastic right-hand sides
Cited in
(20)- Exact solution approaches for bilevel assignment problems
- Bilevel programming with knapsack constraints
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- Exact solution of a class of nonlinear knapsack problems
- An exact algorithm for bilevel 0-1 knapsack problems
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- On bilevel optimization with inexact follower
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
- The bilevel knapsack problem with stochastic right-hand sides
- Solution techniques for bi-level knapsack problems
- A simple greedy heuristic for linear assignment interdiction
- A study on the computational complexity of the bilevel knapsack problem
- Sequential Shortest Path Interdiction with Incomplete Information
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- A class of algorithms for mixed-integer bilevel min-max optimization
- Exact solution approaches for bilevel lot-sizing
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Parametric Solution for Linear Bicriteria Knapsack Models
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
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)
