✦ LIBER ✦

On the complexity of the surrogate dual of 0–1 programming

✍ Scribed by Endre Boros

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On complexity of unconstrained hyperboli

✍ Oleg A. Prokopyev; Hong-Xuan Huang; Panos M. Pardalos 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 179 KB

An exact search for the solution of the

✍ Arnaud Fréville; Gérard Plateau 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 598 KB

The impact of programming methodology on

✍ D.L. Carver; D.B. Simmons 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

On the complexity of computing bilinear

✍ Teofilo Gonzalez; Joseph Ja'Ja' 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 903 KB

The Graver Complexity of Integer Program

✍ Yael Berstein; Shmuel Onn 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 220 KB

On the complexity of the dual method for

✍ Uwe Zimmermann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 837 KB