✦ LIBER ✦

The Complexity of Combinatorial Optimization Problems on d ‐Dimensional Boxes

✍ Scribed by Chlebík, Miroslav; Chlebíková, Janka

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of a class of combinat

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

On the Complexity of Nonoverlapping Mult

✍ Doan, Xuan Vinh; Natarajan, Karthik 📂 Article 📅 2012 🏛 INFORMS 🌐 English ⚖ 211 KB

On the depth of combinatorial optimizati

✍ W. Kern 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 845 KB

On Intrinsic Complexity of Nash Equilibr

✍ D. Dorsch, H. T. Jongen, V. Shikhman 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 995 KB

On the complexity of the exchange algori

✍ Zvi Drezner 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 171 KB

Sequential algorithm for the solution of

✍ A. N. Khodzinskii 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 618 KB