✦ LIBER ✦

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 7801 || A Complexity and Approximability Study of the Bilevel Knapsack Problem

✍ Scribed by Goemans, Michel; Correa, José

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Inte

✍ Cunningham, William H.; McCormick, S. Thomas; Queyranne, Maurice 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 776 KB

[Lecture Notes in Computer Science] Inte

✍ Cook, William J.; Schulz, Andreas S. 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 299 KB

[Lecture Notes in Computer Science] Inte

✍ Lodi, Andrea; Panconesi, Alessandro; Rinaldi, Giovanni 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg ⚖ 265 KB

[Lecture Notes in Computer Science] Inte

✍ Goemans, Michel; Correa, José 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg ⚖ 262 KB

[Lecture Notes in Computer Science] Inte

✍ Bienstock, Daniel; Nemhauser, George 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 247 KB

[Lecture Notes in Computer Science] Inte

✍ Aardal, Karen; Gerards, Bert 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 130 KB