☆
3.8
Proceedings Paper
Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2019 (2019)
Export Citation
No citation available
Rate this paper
The primary rating indicates the level of overall quality for the paper. Secondary ratings independently reflect strengths or weaknesses of the paper.
Find the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
SearchAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started