Solution techniques for bi-level knapsack problems

DOI10.1016/J.COR.2023.106343OpenAlexW4383105063MaRDI QIDQ6047889

Shraddha Ghatkar, Ashwin Arulselvan, Alec Morton

Publication date: 13 September 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106343

zbMATH Keywords

Stackelberg gamesbi-level optimizationbi-level knapsack problemshealthcare economics

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
• Approximation algorithms for a bi-level knapsack problem
• Parametric integer programming algorithm for bilevel mixed integer programs
• Bilevel programming: a survey
• A dynamic programming algorithm for the bilevel Knapsack problem
• Linear bilevel programming with upper level constraints depending on the lower level solution
• An algorithm for the mixed-integer nonlinear bilevel programming problem
• On the use of intersection cuts for bilevel optimization
• Discrete linear bilevel programming problem
• One-level reformulation of the bilevel Knapsack problem using dynamic programming
• An exact algorithm for bilevel 0-1 knapsack problems
• On the Stackelberg knapsack game
• An enhanced branch-and-bound algorithm for bilevel integer linear programming
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
• Bilevel optimization. Advances and next challenges
• A Stackelberg knapsack game with weight control
• Improved approximation algorithms for a bilevel knapsack problem
• Bilevel Knapsack with Interdiction Constraints
• A Study on the Computational Complexity of the Bilevel Knapsack Problem
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
• Bilevel programming with discrete lower level problems
• The polynomial hierarchy and a simple model for competitive analysis
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
• A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
• On stackelberg pricing with computationally bounded customers
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
• Interdiction Games and Monotonicity, with Application to Knapsack Problems
• The Mixed Integer Linear Bilevel Programming Problem
• Mathematical Programs with Optimization Problems in the Constraints
• Optimizing Frequencies in a Transit Network: a Nonlinear Bi‐level Programming Approach
• Bilevel programming with knapsack constraints
• A survey on mixed-integer programming techniques in bilevel optimization

This page was built for publication: Solution techniques for bi-level knapsack problems