✦ LIBER ✦

R70-4 Analysis of Algorithms for the Zero–One Programming Problem

✍ Scribed by Geoffrion, A.M.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic programming algorithms for the Z

✍ P. Toth 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 786 KB

A zero-one goal programming approach for

✍ Marc J. Schniederjans; Radhika Santhanam 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 899 KB

Two fuzzy possibilistic bi-objective zer

✍ Vahdani, Behnam; Jolai, Fariborz; Tavakkoli-Moghaddam, Reza; Mousavi, S. Meysam 📂 Article 📅 2012 🏛 Taylor and Francis Group 🌐 English ⚖ 264 KB

The complexity of approximate algorithms

✍ N.N. Kuzyurin 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 334 KB

A generalization of the zero–one princip

✍ Dorothea Wagner; Frank Wagner 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 518 KB

A linear-size zero—one programming model

✍ Justin C. Williams 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB