✦ LIBER ✦

Upper bounds for objective functions of discrete competitive facility location problems

✍ Scribed by V. L. Beresnev

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Randomized local search for the discrete

✍ Mel’nikov, A. A. 📂 Article 📅 2014 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 223 KB

Branch-and-bound algorithm for a competi

✍ Beresnev, Vladimir 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 284 KB

A robust model for a leader–follower com

✍ Ashtiani, Milad Gorji; Makui, Ahmad; Ramezanian, Reza 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 287 KB

Lower and upper bounds for a two-stage c

✍ Li, Jinfeng; Chu, Feng; Prins, Christian; Zhu, Zhanguo 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 671 KB

A polygonal upper bound for the efficien

✍ Emilio Carrizosa Priego; Francisco Ramón Fernández García 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 382 KB

Approximating the Pareto-front of a plan

✍ Redondo, Juana L.; Fernández, José; Domingo Álvarez Hervás, José; Gila Arrondo, 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 516 KB