IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v289y2020i2d10.1007_s10479-020-03561-4.html
   My bibliography  Save this article

Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks

Author

Listed:
  • Esmaeil Afrashteh

    (Sahand University of Technology)

  • Behrooz Alizadeh

    (Sahand University of Technology)

  • Fahimeh Baroughi

    (Sahand University of Technology)

Abstract

This paper is concerned with the upgrading selective obnoxious p-median location problem on tree networks in which the existing customer points and the candidate facility locations are assumed to be two selective subsets of the vertex set of the underlying tree. The task is to augment the edge lengths within associated bounds and a budget constraint on the overall modification cost so that the optimal selective obnoxious p-median objective value is maximized under the new edge lengths. Exact optimal algorithms with polynomial time complexities are developed for cases $$p=1 $$p=1 and $$p\ge 2$$p≥2. Moreover, it is shown that if the bound constraints are dropped, then the problems under investigation can be solved in lower times.

Suggested Citation

  • Esmaeil Afrashteh & Behrooz Alizadeh & Fahimeh Baroughi, 2020. "Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks," Annals of Operations Research, Springer, vol. 289(2), pages 153-172, June.
    • Handle: RePEc:spr:annopr:v:289:y:2020:i:2:d:10.1007_s10479-020-03561-4
    DOI: 10.1007/s10479-020-03561-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-020-03561-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-020-03561-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Behrooz Alizadeh & Esmaeil Afrashteh & Fahimeh Baroughi, 2018. "Combinatorial Algorithms for Some Variants of Inverse Obnoxious Median Location Problem on Tree Networks," Journal of Optimization Theory and Applications, Springer, vol. 178(3), pages 914-934, September.
    2. S. S. Ting, 1984. "A Linear-Time Algorithm for Maxisum Facility Location on Tree Networks," Transportation Science, INFORMS, vol. 18(1), pages 76-84, February.
    3. Frank Plastria, 2016. "Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams," Annals of Operations Research, Springer, vol. 246(1), pages 227-251, November.
    4. Behrooz Alizadeh & Rainer Burkard, 2013. "A linear time algorithm for inverse obnoxious center location problems on networks," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(3), pages 585-594, September.
    5. Burkard, Rainer E. & Lin, Yixun & Zhang, Jianzhong, 2004. "Weight reduction problems with certain bottleneck objectives," European Journal of Operational Research, Elsevier, vol. 153(1), pages 191-199, February.
    6. Sven O. Krumke & Madhav V. Marathe & Hartmut Noltemeier & R. Ravi & S. S. Ravi, 1998. "Approximation Algorithms for Certain Network Improvement Problems," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 257-288, September.
    7. Roghayeh Etemad & Behrooz Alizadeh, 2018. "Reverse selective obnoxious center location problems on tree graphs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(3), pages 431-450, June.
    8. Egon Balas & Eitan Zemel, 1980. "An Algorithm for Large Zero-One Knapsack Problems," Operations Research, INFORMS, vol. 28(5), pages 1130-1154, October.
    9. ., 2007. "A Statement of the Problem," Chapters, in: The Causes, Costs and Compensations of Inflation, chapter 1, Edward Elgar Publishing.
    10. A. J. Goldman, 1971. "Optimal Center Location in Simple Networks," Transportation Science, INFORMS, vol. 5(2), pages 212-221, May.
    11. Elisabeth Gassner, 2009. "A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric," Annals of Operations Research, Springer, vol. 172(1), pages 393-404, November.
    12. Jui-Chung Allen Li, 2007. "The Kids Are OK Divorce and Children's Behavior Problems," Working Papers WR-489, RAND Corporation.
    13. G. Y. Handler, 1973. "Minimax Location of a Facility in an Undirected Tree Graph," Transportation Science, INFORMS, vol. 7(3), pages 287-293, August.
    14. Elisabeth Gassner, 2008. "The inverse 1-maxian problem with edge length modification," Journal of Combinatorial Optimization, Springer, vol. 16(1), pages 50-67, July.
    15. Jui-Chung Allen Li, 2007. "The Kids Are OK Divorce and Children's Behavior Problems," Working Papers 489, RAND Corporation.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Baldomero-Naranjo, Marta & Kalcsics, Jörg & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2022. "Upgrading edges in the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 303(1), pages 14-36.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wei Ding & Ke Qiu, 2018. "A quadratic time exact algorithm for continuous connected 2-facility location problem in trees," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1262-1298, November.
    2. Trung Kien Nguyen & Nguyen Thanh Hung & Huong Nguyen-Thu, 2020. "A linear time algorithm for the p-maxian problem on trees with distance constraint," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 1030-1043, November.
    3. Elisabeth Gassner, 2009. "A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric," Annals of Operations Research, Springer, vol. 172(1), pages 393-404, November.
    4. Esmaeil Afrashteh & Behrooz Alizadeh & Fahimeh Baroughi & Kien Trung Nguyen, 2018. "Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-22, October.
    5. Gassner, Elisabeth, 2009. "Up- and downgrading the 1-center in a network," European Journal of Operational Research, Elsevier, vol. 198(2), pages 370-377, October.
    6. Alizadeh, Behrooz & Afrashteh, Esmaeil, 2020. "Budget-constrained inverse median facility location problem on tree networks," Applied Mathematics and Computation, Elsevier, vol. 375(C).
    7. Kien Trung Nguyen, 2016. "Inverse 1-Median Problem on Block Graphs with Variable Vertex Weights," Journal of Optimization Theory and Applications, Springer, vol. 168(3), pages 944-957, March.
    8. Liying Kang & Yukun Cheng, 2010. "The p-maxian problem on block graphs," Journal of Combinatorial Optimization, Springer, vol. 20(2), pages 131-141, August.
    9. Behrooz Alizadeh & Somayeh Bakhteh, 2017. "A modified firefly algorithm for general inverse p-median location problems under different distance norms," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 618-636, September.
    10. Rainer Burkard & Jafar Fathali, 2007. "A polynomial method for the pos/neg weighted 3-median problem on a tree," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(2), pages 229-238, April.
    11. Chunsong Bai & Jun Du, 2024. "The Constrained 2-Maxian Problem on Cycles," Mathematics, MDPI, vol. 12(6), pages 1-9, March.
    12. Mulder, H.M. & Pelsmajer, M.J. & Reid, K.B., 2006. "Generalized centrality in trees," Econometric Institute Research Papers EI 2006-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    13. Behrooz Alizadeh & Esmaeil Afrashteh & Fahimeh Baroughi, 2018. "Combinatorial Algorithms for Some Variants of Inverse Obnoxious Median Location Problem on Tree Networks," Journal of Optimization Theory and Applications, Springer, vol. 178(3), pages 914-934, September.
    14. Van Huy Pham & Nguyen Chi Tam, 2019. "A combinatorial algorithm for the ordered 1-median problem on cactus graphs," OPSEARCH, Springer;Operational Research Society of India, vol. 56(3), pages 780-789, September.
    15. Elisabeth Gassner, 2012. "An inverse approach to convex ordered median problems in trees," Journal of Combinatorial Optimization, Springer, vol. 23(2), pages 261-273, February.
    16. Baldomero-Naranjo, Marta & Kalcsics, Jörg & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2022. "Upgrading edges in the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 303(1), pages 14-36.
    17. Guan, Xiucui & Zhang, Jianzhong, 2006. "A class of node based bottleneck improvement problems," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1540-1552, November.
    18. Mehdi Zaferanieh & Jafar Fathali, 2012. "Finding a core of a tree with pos/neg weight," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(2), pages 147-160, October.
    19. Fahimeh Baroughi Bonab & Rainer Burkard & Elisabeth Gassner, 2011. "Inverse p-median problems with variable edge lengths," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 263-280, April.
    20. Rainer E. Burkard & Johannes Hatzl, 2010. "Median problems with positive and negative weights on cycles and cacti," Journal of Combinatorial Optimization, Springer, vol. 20(1), pages 27-46, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:289:y:2020:i:2:d:10.1007_s10479-020-03561-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.