An exact algorithm for bilevel 0-1 knapsack problems

DOI10.1155/2012/504713zbMath1264.90149WikidataQ58911904 ScholiaQ58911904MaRDI QIDQ1954852

Saïd Hanafi, Raïd Mansi, Cláudio Alves, José M. Valério de Carvalho

Publication date: 11 June 2013

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/504713

Mathematics Subject Classification ID

90C27: Combinatorial optimization

90C39: Dynamic programming

90C09: Boolean programming

Related Items

Solution techniques for bi-level knapsack problems, Enhanced exact algorithms for discrete bilevel linear problems, Exact solution approach for a class of nonlinear bilevel knapsack problems, Knapsack problems -- an overview of recent advances. I: Single knapsack problems, The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective, Improved approximation algorithms for a bilevel knapsack problem, An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bilevel programming: a survey
• A dynamic programming algorithm for the bilevel Knapsack problem
• A trust region algorithm for nonlinear bilevel programming
• Foundations of bilevel programming
• Weak via strong Stackelberg problem: New results
• One-level reformulation of the bilevel Knapsack problem using dynamic programming
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
• On a stochastic bilevel programming problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Pivot and Complement–A Heuristic for 0-1 Programming
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• The Mixed Integer Linear Bilevel Programming Problem
• Mathematical Programs with Optimization Problems in the Constraints
• Bilevel programming with knapsack constraints