On exact solution approaches for bilevel quadratic 0-1 knapsack problem
From MaRDI portal
(Redirected from Publication:829202)
Recommendations
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- An exact algorithm for bilevel 0-1 knapsack problems
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
- A dynamic programming algorithm for the bilevel Knapsack problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- 0-1 quadratic knapsack problems: an exact approach based on a \(t\)-linearization
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- A Selection Problem of Shared Fixed Costs and Network Flows
- A computational study for bilevel quadratic programs using semidefinite relaxations
- A dynamic programming algorithm for the bilevel Knapsack problem
- A dynamic programming heuristic for the quadratic knapsack problem
- A new upper bound for the 0-1 quadratic knapsack problem
- A note on constraint aggregation and value functions for two-stage stochastic integer programs
- A note on linearized reformulations for a class of bilevel linear integer problems
- A simple greedy heuristic for linear assignment interdiction
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- An overview of bilevel optimization
- Bilevel programming with knapsack constraints
- Computational Difficulties of Bilevel Linear Programming
- Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
- Descent approaches for quadratic bilevel programming
- Exact Solution of the Quadratic Knapsack Problem
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Exact solution approaches for bilevel assignment problems
- Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem
- Links between linear bilevel and mixed 0-1 programming problems
- Mathematical Programs with Optimization Problems in the Constraints
- Multilevel optimization: algorithms and applications
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On a level-set characterization of the value function of an integer program and its application to stochastic programming
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- Production and marketing decisions with multiple objectives in a competitive environment
- Quadratic knapsack problems
- Solution of large quadratic knapsack problems through aggressive reduction
- The Linear-Quadratic Bilevel Programming Problem
- The bilevel knapsack problem with stochastic right-hand sides
- The polynomial hierarchy and a simple model for competitive analysis
- 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
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(10)- An exact algorithm for bilevel 0-1 knapsack problems
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- On bilevel optimization with inexact follower
- A dynamic programming algorithm for the bilevel Knapsack problem
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
This page was built for publication: On exact solution approaches for bilevel quadratic 0-1 knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q829202)
