Inverse 1-median problem on block graphs with variable vertex weights

DOI10.1007/s10957-015-0829-2zbMath1338.90085MaRDI QIDQ283940

Kien Trung Nguyen

Publication date: 17 May 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-015-0829-2

zbMATH Keywords

location problem; convex; block graph; continuous knapsack problem; inverse optimization

Mathematics Subject Classification ID

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

90B80: Discrete location and assignment

Related Items

Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems, Optimal algorithms for some inverse uncapacitated facility location problems on networks, Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance, Some polynomially solvable cases of the inverse ordered 1-median problem on trees, Optimal algorithms for selective variants of the classical and inverse median location problems on trees, On some inverse 1-center location problems, Resource allocation in rooted trees for VLSI applications, Reverse 1-centre problem on trees under convex piecewise-linear cost function, Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks, The max-sum inverse median location problem on trees with budget constraint, The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction, Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm, The inverse connected \(p\)-median problem on block graphs under various cost functions, A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint, On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks, The inverse 1-center problem on cycles with variable edge lengths, Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks, Reverse 1-maxian problem with keeping existing 1-median, A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms, Classical and inverse median location problems under uncertain environment, Inverse anti-\(k\)-centrum problem on networks with variable edge lengths, Inverse group 1-median problem on trees, Inverse single facility location problem on a tree with balancing on the distance of server to clients, Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm, The minmax regret inverse maximum weight problem, Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective, Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms, Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees, Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms, Inverse and reverse balanced facility location problems with variable edge lengths on trees, The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion, A generalized interval type-2 fuzzy random variable based algorithm under mean chance value at risk criterion for inverse 1-median location problems on tree networks with uncertain costs

Cites Work

• Unnamed Item
• Unnamed Item
• A linear time algorithm for inverse obnoxious center location problems on networks
• Inverse eccentric vertex problem on networks
• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• An inverse approach to convex ordered median problems in trees
• Inverse 1-median problem on trees under weighted Hamming distance
• Inverse \(k\)-centrum problem on trees with variable vertex weights
• Inverse \(p\)-median problems with variable edge lengths
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• The inverse 1-median problem on a cycle
• Inverse 1-center location problems with edge length augmentation on trees
• The complexity analysis of the inverse center location problem
• Inverse median problems
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Location Theory
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An Algorithm for Large Zero-One Knapsack Problems
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions