IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v168y2016i3d10.1007_s10957-015-0829-2.html
   My bibliography  Save this article

Inverse 1-Median Problem on Block Graphs with Variable Vertex Weights

Author

Listed:
  • Kien Trung Nguyen

    (Cantho University)

Abstract

This paper addresses the problem of modifying the vertex weights of a block graph at minimum total cost so that a prespecified vertex becomes a 1-median of the perturbed graph. We call this problem the inverse 1-median problem on block graphs with variable vertex weights. For block graphs with equal edge lengths in each block, we can formulate the problem as a univariate optimization problem. By the convexity of the objective function, the local optimizer is also the global one. Therefore, we use the convexity to develop an $$O(M\log M)$$ O ( M log M ) algorithm that solves the problem on block graphs with M vertices.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:168:y:2016:i:3:d:10.1007_s10957-015-0829-2
    DOI: 10.1007/s10957-015-0829-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-015-0829-2
    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/s10957-015-0829-2?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. Nguyen, Kien Trung & Chassein, André, 2015. "The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance," European Journal of Operational Research, Elsevier, vol. 247(3), pages 774-781.
    2. Kien Nguyen & André Chassein, 2015. "Inverse eccentric vertex problem 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. 23(3), pages 687-698, September.
    3. Egon Balas & Eitan Zemel, 1980. "An Algorithm for Large Zero-One Knapsack Problems," Operations Research, INFORMS, vol. 28(5), pages 1130-1154, October.
    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. 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.
    6. 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.
    7. A. J. Goldman, 1971. "Optimal Center Location in Simple Networks," Transportation Science, INFORMS, vol. 5(2), pages 212-221, May.
    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. Kien Trung Nguyen & Nguyen Thanh Hung, 2020. "The inverse connected p-median problem on block graphs under various cost functions," Annals of Operations Research, Springer, vol. 292(1), pages 97-112, September.
    2. 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.
    3. Nguyen, Kien Trung & Hung, Nguyen Thanh, 2021. "The minmax regret inverse maximum weight problem," Applied Mathematics and Computation, Elsevier, vol. 407(C).
    4. Kien Trung Nguyen & Huong Nguyen-Thu & Nguyen Thanh Hung, 2018. "On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 88(2), pages 147-159, October.
    5. Kien Trung Nguyen, 2019. "The inverse 1-center problem on cycles with variable edge lengths," 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. 27(1), pages 263-274, March.
    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. 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.
    8. 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.
    9. Shahede Omidi & Jafar Fathali & Morteza Nazari, 2020. "Inverse and reverse balanced facility location problems with variable edge lengths on trees," OPSEARCH, Springer;Operational Research Society of India, vol. 57(2), pages 261-273, June.
    10. Ali Reza Sepasian, 2019. "Reverse 1-maxian problem with keeping existing 1-median," OPSEARCH, Springer;Operational Research Society of India, vol. 56(1), pages 1-13, March.

    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. 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.
    2. Alizadeh, Behrooz & Afrashteh, Esmaeil, 2020. "Budget-constrained inverse median facility location problem on tree networks," Applied Mathematics and Computation, Elsevier, vol. 375(C).
    3. Kien Trung Nguyen, 2019. "The inverse 1-center problem on cycles with variable edge lengths," 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. 27(1), pages 263-274, March.
    4. 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.
    5. 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.
    6. Kien Trung Nguyen & Nguyen Thanh Hung, 2020. "The inverse connected p-median problem on block graphs under various cost functions," Annals of Operations Research, Springer, vol. 292(1), pages 97-112, September.
    7. Kien Nguyen & Lam Anh, 2015. "Inverse $$k$$ k -centrum problem on trees with variable vertex weights," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 19-30, August.
    8. Nguyen, Kien Trung & Hung, Nguyen Thanh, 2021. "The minmax regret inverse maximum weight problem," Applied Mathematics and Computation, Elsevier, vol. 407(C).
    9. 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.
    10. 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.
    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. 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.
    13. 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.
    14. Nguyen, Kien Trung & Chassein, André, 2015. "The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance," European Journal of Operational Research, Elsevier, vol. 247(3), pages 774-781.
    15. Kien Trung Nguyen & Huong Nguyen-Thu & Nguyen Thanh Hung, 2018. "On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 88(2), pages 147-159, October.
    16. M. Drozdowski & N. V. Shakhlevich, 2021. "Scheduling divisible loads with time and cost constraints," Journal of Scheduling, Springer, vol. 24(5), pages 507-521, October.
    17. Balakrishnan, K. & Changat, M. & Mulder, H.M. & Subhamathi, A.R., 2011. "Consensus Strategies for Signed Profiles on Graphs," Econometric Institute Research Papers EI2011-34, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    18. David Pisinger, 1999. "Core Problems in Knapsack Algorithms," Operations Research, INFORMS, vol. 47(4), pages 570-575, August.
    19. Andrej Kastrin & Janez Povh & Lidija Zadnik Stirn & Janez Žerovnik, 2021. "Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR," 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. 29(3), pages 773-790, September.
    20. M Hifi & M Michrafy, 2006. "A reactive local search-based algorithm for the disjunctively constrained knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 718-726, June.

    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:joptap:v:168:y:2016:i:3:d:10.1007_s10957-015-0829-2. 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.