✦ LIBER ✦

A relaxation/decomposition algorithm for the fixed charged network problem

✍ Scribed by Bala Shetty

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-cut algorithm for the singl

✍ Francisco Ortega; Laurence A. Wolsey 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 1 views

Decomposition algorithms for the design

✍ April K. Andreas; J. Cole Smith 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB

A linear-time algorithm for the k-fixed-

✍ Katerina Asdre; Stavros D. Nikolopoulos 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB 👁 1 views

On the use of guided design search for d

✍ Mark W. Lewis 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

Decomposition algorithms for finding the

✍ Suleyman Tufekci 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

A note on the primal-dual and out-of-kil

✍ J. F. Shapiro 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 341 KB 👁 1 views