Inverse 1-Median Problem on Block Graphs with Variable Vertex Weights
Kien Trung Nguyen ()
Additional contact information
Kien Trung Nguyen: Cantho University
Journal of Optimization Theory and Applications, 2016, vol. 168, issue 3, No 12, 944-957
Abstract:
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.
Keywords: Location problem; Inverse optimization; Continuous knapsack problem; Block graph; Convex; 90B10; 90B80; 90C27 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)
Downloads: (external link)
http://link.springer.com/10.1007/s10957-015-0829-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:168:y:2016:i:3:d:10.1007_s10957-015-0829-2
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-015-0829-2
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().