On exact solution approaches for bilevel quadratic 0-1 knapsack problem

DOI10.1007/s10479-018-2970-4zbMath1460.90125OpenAlexW2886518978MaRDI QIDQ829202

Oleg A. Prokopyev, Gabriel Lopez Zenarosa, 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

zbMATH Keywords

dynamic programmingbilevel programmingquadratic knapsack problembilevel knapsack problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (1)

SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs

Uses Software

• BARON
• R
• CPLEX
• Gurobi
• Knapsack

Cites Work

• Exact solution approaches for bilevel assignment problems
• A computational study for bilevel quadratic programs using semidefinite relaxations
• Two-stage quadratic integer programs with stochastic right-hand sides
• A simple greedy heuristic for linear assignment interdiction
• A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• A dynamic programming algorithm for the bilevel Knapsack problem
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• The quadratic knapsack problem -- a survey
• The bilevel knapsack problem with stochastic right-hand sides
• Production and marketing decisions with multiple objectives in a competitive environment
• Descent approaches for quadratic bilevel programming
• Multilevel optimization: algorithms and applications
• Links between linear bilevel and mixed 0-1 programming problems
• A note on linearized reformulations for a class of bilevel linear integer problems
• A new upper bound for the 0-1 quadratic knapsack problem
• One-level reformulation of the bilevel Knapsack problem using dynamic programming
• Exact solution approach for a class of nonlinear bilevel knapsack problems
• A note on constraint aggregation and value functions for two-stage stochastic integer programs
• Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem
• An overview of bilevel optimization
• A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
• Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
• Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
• Computational Difficulties of Bilevel Linear Programming
• The polynomial hierarchy and a simple model for competitive analysis
• Quadratic knapsack problems
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
• The Linear-Quadratic Bilevel Programming Problem
• Exact Solution of the Quadratic Knapsack Problem
• 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization
• On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming
• A Selection Problem of Shared Fixed Costs and Network Flows
• Mathematical Programs with Optimization Problems in the Constraints
• Bilevel programming with knapsack constraints
• Unnamed Item
• Unnamed Item

This page was built for publication: On exact solution approaches for bilevel quadratic 0-1 knapsack problem