The max-sum inverse median location problem on trees with budget constraint

DOI10.1016/j.amc.2023.128296MaRDI QIDQ6095060

Huong Nguyen-Thu, Kien Trung Nguyen, Nguyen Thanh Toan

Publication date: 11 October 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

knapsack problemtree graphbudget constraintinverse optimizationmedian problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse 1-median problem on block graphs with variable vertex weights
• A linear time algorithm for inverse obnoxious center location problems on networks
• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
• An inverse approach to convex ordered median problems in trees
• 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 connected \(p\)-median problem on block graphs under various cost functions
• The inverse 1-maxian problem with edge length modification
• Reverse 2-median problem on trees
• The inverse 1-median problem on a cycle
• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Inverse 1-center location problems with edge length augmentation on trees
• Group centre and group median of a network
• 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
• Inverse quickest center location problem on a tree
• Group centre and group median of a tree
• The complexity analysis of the inverse center location problem
• Inverse group 1-median problem on trees
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
• Inverse median problems
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
• Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Location Theory
• Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
• 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
• A linear time algorithm for the reverse 1‐median problem on a cycle

This page was built for publication: The max-sum inverse median location problem on trees with budget constraint