On exact solution approaches for bilevel quadratic 0-1 knapsack problem
From MaRDI portal
Publication:829202
DOI10.1007/S10479-018-2970-4zbMATH Open1460.90125OpenAlexW2886518978MaRDI QIDQ829202FDOQ829202
Authors: Gabriel Lopez Zenarosa, Oleg A. Prokopyev, Eduardo L. Pasiliao 
Publication date: 5 May 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-2970-4
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
Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Dynamic programming (90C39)
Cites Work
- Title not available (Why is that?)
- The quadratic knapsack problem -- a survey
- An overview of bilevel optimization
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- The polynomial hierarchy and a simple model for competitive analysis
- Title not available (Why is that?)
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Links between linear bilevel and mixed 0-1 programming problems
- Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem
- Mathematical Programs with Optimization Problems in the Constraints
- Multilevel optimization: algorithms and applications
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Exact solution approaches for bilevel assignment problems
- Quadratic knapsack problems
- A dynamic programming algorithm for the bilevel Knapsack problem
- Computational Difficulties of Bilevel Linear Programming
- Descent approaches for quadratic bilevel programming
- Solution of large quadratic knapsack problems through aggressive reduction
- A dynamic programming heuristic for the quadratic knapsack problem
- A computational study for bilevel quadratic programs using semidefinite relaxations
- The Linear-Quadratic Bilevel Programming Problem
- Exact Solution of the Quadratic Knapsack Problem
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Production and marketing decisions with multiple objectives in a competitive environment
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
- Bilevel programming with knapsack constraints
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- A Selection Problem of Shared Fixed Costs and Network Flows
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- Two-stage quadratic integer programs with stochastic right-hand sides
- A new upper bound for the 0-1 quadratic knapsack problem
- On a level-set characterization of the value function of an integer program and its application to stochastic programming
- A simple greedy heuristic for linear assignment interdiction
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- The bilevel knapsack problem with stochastic right-hand sides
- A note on linearized reformulations for a class of bilevel linear integer problems
- A note on constraint aggregation and value functions for two-stage stochastic integer programs
- 0-1 quadratic knapsack problems: an exact approach based on a \(t\)-linearization
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
- On bilevel optimization with inexact follower
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- 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
Uses Software
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)
