✦ LIBER ✦

On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems

✍ Scribed by Doan, Xuan Vinh; Natarajan, Karthik

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Combinatorial Optimiza

✍ Chlebík, Miroslav; Chlebíková, Janka 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 197 KB

On the complexity of a class of combinat

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

An approach to estimating the complexity

✍ V. A. Mikhailyuk 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 99 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

A metaheuristic framework for stochastic

✍ Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 581 KB