✦ LIBER ✦

A simple and deterministic competitive algorithm for online facility location

✍ Scribed by Aris Anagnostopoulos; Russell Bent; Eli Upfal; Pascal Van Hentenryck

Book ID: 113641532
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 491 KB
Volume: 194
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.06.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple dual ascent algorithm for the m

A simple dual ascent algorithm for the multilevel facility location problem

✍ A.F. Dumb; W. Kern 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 210 KB

A Deterministic Algorithm for Robust Loc

A Deterministic Algorithm for Robust Location and Scatter

✍ Hubert, Mia; Rousseeuw, Peter J.; Verdonck, Tim 📂 Article 📅 2012 🏛 American Statistical Association 🌐 English ⚖ 746 KB

A Location Allocation Model for Facility

A Location Allocation Model for Facility Planning in a Competitive Environment

✍ Avijit Ghosh; C. Samuel Craig 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 905 KB

A robust and efficient algorithm for pla

A robust and efficient algorithm for planar competitive location problems

✍ J. L. Redondo; J. Fernández; I. García; P. M. Ortigosa 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 454 KB

An approximation algorithm for a facilit

An approximation algorithm for a facility location problem with stochastic demands and inventories

✍ A.F. Gabor; J.C.W. van Ommeren 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 176 KB

We propose a 2-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. Costs incurred are expected transportation costs, facility operating

A branch-and-bound algorithm for the mul

A branch-and-bound algorithm for the multi-level uncapacitated facility location problem

✍ Dong-wan Tcha; Bum-il Lee 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 518 KB