An approximation scheme for a bilevel knapsack problem

DOI10.1007/978-3-031-41229-5_3OpenAlexW4388097718MaRDI QIDQ6119444

Ashwin Arulselvan, Altannar Chinchuluun

Publication date: 22 March 2024

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-41229-5_3

zbMATH Keywords

knapsack problembilevel optimizationglobal fund allocation problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• Knapsack problems with setups
• Foundations of bilevel programming
• An overview of bilevel optimization
• Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Bilevel programming with knapsack constraints
• Unnamed Item

This page was built for publication: An approximation scheme for a bilevel knapsack problem