✦ LIBER ✦

Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements

✍ Scribed by O. O. Iemetsa, O. O. Yemetsa

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the optimality conditions for the pro

✍ G. Pesamosca 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 171 KB

A linear relaxation algorithm for solvin

✍ Carlsson, John Gunnar; Shi, Jianming 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 349 KB

Solving the conditional optimization pro

✍ I. V. Sergienko, O. A. Iemets, O. A. Chernenko 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 84 KB

On the complexity of a class of combinat

✍ Igor Averbakh 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 110 KB

On the duality of a non-convex optimizat

✍ Thomas Fischer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 465 KB

On two problems of choosing some subset

✍ E. Kh. Gimadi; Yu. V. Glazkov; I. A. Rykov 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 642 KB