✦ LIBER ✦

[Algorithms and Combinatorics] Combinatorial Optimization Volume 21 || The Knapsack Problem

✍ Scribed by Korte, Bernhard; Vygen, Jens

Book ID: 121338741
Publisher: Springer Berlin Heidelberg
Year: 2011
Weight: 174 KB
Category: Article
ISBN: 3642244882
DOI: 10.1007/978-3-642-24488-9_17

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Algorithms and Combinatorics] Combinato

[Algorithms and Combinatorics] Combinatorial Optimization Volume 21 || The Traveling Salesman Problem

✍ Korte, Bernhard; Vygen, Jens 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 604 KB

[Algorithms and Combinatorics] Combinato

[Algorithms and Combinatorics] Combinatorial Optimization Volume 21 || Approximation Algorithms

✍ Korte, Bernhard; Vygen, Jens 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 495 KB

[Algorithms and Combinatorics] Combinato

[Algorithms and Combinatorics] Combinatorial Optimization Volume 21 || Graphs

✍ Korte, Bernhard; Vygen, Jens 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 534 KB

[Algorithms and Combinatorics 21] Combin

[Algorithms and Combinatorics 21] Combinatorial Optimization Volume 21 || Integer Programming

✍ , 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 German ⚖ 184 KB

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It

[Algorithms and Combinatorics] Combinato

[Algorithms and Combinatorics] Combinatorial Optimization Volume 21 || Facility Location

✍ Korte, Bernhard; Vygen, Jens 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 371 KB

[Algorithms and Combinatorics] Combinato

[Algorithms and Combinatorics] Combinatorial Optimization Volume 21 || Shortest Paths

✍ Korte, Bernhard; Vygen, Jens 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 189 KB