✦ LIBER ✦

Lagrangean decompositions for the unconstrained binary quadratic programming problem

✍ Scribed by Geraldo Regis Mauri; Luiz Antonio Nogueira Lorena

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improving a Lagrangian decomposition for

✍ Geraldo Regis Mauri; Luiz Antonio Nogueira Lorena 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 308 KB

A column generation approach for the unc

✍ Geraldo Regis Mauri; Luiz Antonio Nogueira Lorena 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Path relinking for unconstrained binary

✍ Wang, Yang; Lü, Zhipeng; Glover, Fred; Hao, Jin-Kao 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 299 KB

An Unconstrained Quadratic Binary Progra

✍ Gary A. Kochenberger; Fred Glover; Bahram Alidaee; Cesar Rego 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 225 KB

Combining tabu Hopfield network and esti

✍ Jiahai Wang; Ying Zhou; Jian Yin 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 270 KB

Greedy and Local Search Heuristics for U

✍ Peter Merz; Bernd Freisleben 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 136 KB