𝔖 Bobbio Scriptorium

✦ LIBER ✦

Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding

✍ Scribed by Drwal, Maciej; Jozefczyk, Jerzy

Book ID: 121639482
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 629 KB
Volume: 222
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-013-1330-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

98/00375 A combination of the genetic al

98/00375 A combination of the genetic algorithm and Lagrangian relaxation decomposition techniques for the generation unit commitment problem

📂 Article 📅 1998 🏛 Elsevier Science ⚖ 203 KB

A data structure and algorithm based on

A data structure and algorithm based on a linear key for a rectangle retrieval problem

✍ D.J. Abel; J.L. Smith 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 567 KB

A branch and bound algorithm for the sym

A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation

✍ Ton Volgenant; Roy Jonker 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 538 KB

[IEEE 2012 International Conference on I

[IEEE 2012 International Conference on Industrial Control and Electronics Engineering (ICICEE) - Xi'an, China (2012.08.23-2012.08.25)] 2012 International Conference on Industrial Control and Electronics Engineering - An Adaptive Simulated Annealing Genetic Algorithm for the Data Placement Problem in Saas

✍ Bowen, Yuan; Shaochun, Wu 📂 Article 📅 2012 🏛 IEEE ⚖ 172 KB

[IEEE 2012 International Conference on W

[IEEE 2012 International Conference on Wavelet Active Media Technology and Information Processing (ICWAMTIP) - Chengdu, China (2012.12.17-2012.12.19)] 2012 International Conference on Wavelet Active Media Technology and Information Processing (ICWAMTIP) - An instances placement algorithm based on disk I/O load for big data in private cloud

✍ Jian Guo, ; Zhao-Meng Zhu, ; Xiu-Min Zhou, ; Gong-Xuan Zhang, 📂 Article 📅 2012 🏛 IEEE ⚖ 592 KB

[IEEE 2013 International Conference on A

[IEEE 2013 International Conference on Advanced Logistics and Transport (ICALT) - Sousse, Tunisia (2013.05.29-2013.05.31)] 2013 International Conference on Advanced Logistics and Transport - New Greedy Randomized Adaptive Search Procedure based on differential evolution algorithm for solving no-wait flowshop scheduling problem

✍ Akrout, Hanen; Jarboui, Bassem; Rebai, Abdelwaheb; Siarry, Patrick 📂 Article 📅 2013 🏛 IEEE ⚖ 292 KB