𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Computational Science - ICCS 2001 Volume 2074 || Heuristic Solutions for the Multiple-Choice Multi-dimension Knapsack Problem

✍ Scribed by Alexandrov, Vassil N.; Dongarra, Jack J.; Juliano, Benjoe A.; Renner, René S.; Tan, C. J. Kenneth

Book ID
115494597
Publisher
Springer Berlin Heidelberg
Year
2001
Weight
223 KB
Category
Article
ISBN
3540422331

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Hybr
[Lecture Notes in Computer Science] Hybrid Metaheuristics Volume 6373 || New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem
✍ Blesa, María J.; Blum, Christian; Raidl, Günther; Roli, Andrea; Sampels, Michael 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 298 KB

Annotation. This Book Constitutes The Refereed Proceedings Of The 7th International Workshop On Hybrid Metaheuristics, Hm 2010, Held In Vienna, Austria, In October 2010. The 14 Revised Full Papers Presented Were Carefully Reviewed And Selected From 29 Submissions.

[Lecture Notes in Computational Science
[Lecture Notes in Computational Science and Engineering] Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations Volume 61 || Eigenvalue Problems
✍ Mathew, Tarek Poonithara Abraham 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 186 KB

Domain decomposition methods are divide and conquer computational methods for the parallel solution of partial differential equations of elliptic or parabolic type. The methodology includes iterative algorithms, and techniques for non-matching grid discretizations and heterogeneous approximations. T