✦ LIBER ✦

Reduced RLT representations for nonconvex polynomial programming problems

✍ Scribed by Hanif D. Sherali; Evrim Dalkiran; Leo Liberti

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for nonconvex programming p

✍ Reiner Horst 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 367 KB

Combined bound-grid-factor constraints f

✍ Hanif D. Sherali; Evrim Dalkiran 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 218 KB

Duality theorems for a class of nonconve

✍ O. Rani; R. N. Kaul 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 152 KB

Interactive fuzzy programming for two-le

✍ Masatoshi Sakawa; Ichiro Nishizaki; Yoshio Uemura; Masatoshi Hitaka 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 1 views

Floating point genetic algorithms for no

✍ Masatoshi Sakawa; Katsuhiro Yauchi 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

A note on the convergence of an algorith

✍ Reiner Horst 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 58 KB