Please use this identifier to cite or link to this item: https://dspace.ctu.edu.vn/jspui/handle/123456789/5110
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNguyễn, Trung Kiên-
dc.date.accessioned2018-11-21T07:39:05Z-
dc.date.available2018-11-21T07:39:05Z-
dc.date.issued2017-
dc.identifier.urihttp://localhost:8080//jspui/handle/123456789/5110-
dc.description.abstractWe consider the problem of modifying edge lengths of a cycle at minimum total costs so as to make a prespecified vertex an (absolute) 1-center of the cycle with respect to the new edge legths.We call this problem the inverse 1-center problem on a cycle. To solve this problem, we first construct the so-called optimality criterion for a vertex to be a 1-center. Based on the optimality criterion, it is shown that the problem can be separated into linearly many subproblems. For a predetermined subproblem, we apply a parameterization approach to formulate it as a minimization problem of a piecewise linear convex function with a connected feasible region. Hence, it is shown that the problem can be solved in O(n² log n) time, where n is the number of vertices in the cycle.vi_VN
dc.language.isoenvi_VN
dc.relation.ispartofseriesCentral European Journal of Operations Research;1 .- p.1-12-
dc.subject1-Center problemvi_VN
dc.subjectInverse optimizationvi_VN
dc.subjectCyclevi_VN
dc.subjectConvexvi_VN
dc.subjectParameteri-zationvi_VN
dc.titleThe inverse 1-center problem on cycles with variable edge lengthsvi_VN
dc.typeArticlevi_VN
Appears in Collections:Tạp chí quốc tế

Files in This Item:
File Description SizeFormat 
_file_421.92 kBAdobe PDFView/Open
Your IP: 34.200.248.66


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.