Solution techniques for bi-level knapsack problems

DOI10.1016/J.COR.2023.106343MaRDI QIDQ6047889zbMATH OpenOpenAlexFDO

Authors Shraddha Ghatkar, Ashwin Arulselvan, Alec Morton

Publication date 13 September 2023

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

bi-level knapsack problemsbi-level optimizationhealthcare economicsStackelberg games

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Approximation algorithms for a bi-level knapsack problem
• Approximation Algorithms for a Bi-level Knapsack Problem
• Bilevel programming with knapsack constraints
• A dynamic programming algorithm for the bilevel Knapsack problem
• Exact solution approach for a class of nonlinear bilevel knapsack problems
• Improved approximation algorithms for a bilevel knapsack problem
• Improved approximation algorithms for a bilevel knapsack problem
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• A complexity and approximability study of the bilevel knapsack problem
• Bilevel knapsack with interdiction constraints

Cites work

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

Cited in

(4)

• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• scientific article; zbMATH DE number 4160465 (Why is no real title available?)
• Approximation Algorithms for a Bi-level Knapsack Problem
• The Maximal covering location disruption problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047889)