Volume 13, Issue 2 (8-2016)                   2016, 13(2): 69-83 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

The Optimal Algorithms for Backup Undesirable 2-Center Location Models on Tree Graphs. Journal of Operational Research and Its Applications. 2016; 13 (2) :69-83
URL: http://jamlu.liau.ac.ir/article-1-1377-en.html
Abstract:   (3686 Views)

In this paper, we investigate the backup undesirable AWT IMAGE-center location models on tree graphs. The aim is to obtain the best locations on the vertex set of the underlying tree for establishing two undesirable servers so that the expected value of the closest distance from the existing customers to the functioning facilities is maximized under the assumption that any facility may fail with a given probability and in this case the other active server must serve all the customers. The exact combinatorial algorithms with AWT IMAGE andAWT IMAGE time complexities are developed for obtaining the optimal solutions of two certain models, where AWT IMAGEis the number of the vertices in the given tree graph.

Full-Text [PDF 283 kb]   (705 Downloads)    
Type of Study: Research | Subject: Special
Received: 2016/11/2 | Accepted: 2016/11/2 | Published: 2016/11/2

Add your comments about this article : Your username or Email:

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.