✦ LIBER ✦

McCormick-Based Relaxations of Algorithms

✍ Scribed by Mitsos, Alexander; Chachuat, Benoît; Barton, Paul I.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergence rate of McCormick relaxation

✍ Agustín Bompadre; Alexander Mitsos 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 476 KB

Algorithms for routing and wavelength as

✍ Krishnaswamy, R.M.; Sivarajan, K.N. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 67 KB

A relaxed gradient based algorithm for s

✍ Qiang Niu; Xiang Wang; Lin-Zhang Lu 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

A network relaxation based enumeration a

✍ Agha Iqbal Ali; Hemalatha Thiagarajan 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 761 KB

Lagrangian relaxation based algorithm fo

✍ Aiying Rong; Risto Lahdelma; Peter B. Luh 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Real-world extensions to scheduling algo

✍ Y Narahari; R Srigopal 📂 Article 📅 1996 🏛 Indian Academy of Sciences 🌐 English ⚖ 835 KB