A Study on the Computational Complexity of the Bilevel Knapsack Problem

Title
A Study on the Computational Complexity of the Bilevel Knapsack Problem
Authors
Keywords
-
Journal
SIAM JOURNAL ON OPTIMIZATION
Volume 24, Issue 2, Pages 823-838
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Online
2014-06-05
DOI
10.1137/130906593

Ask authors/readers for more resources

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More