The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
From MaRDI portal
Publication:6053538
DOI10.1142/s0217595922500336zbMath1525.90256OpenAlexW4293206982MaRDI QIDQ6053538
Huong Nguyen-Thu, Tran Hoai Ngoc Nhan, Kien Trung Nguyen
Publication date: 19 October 2023
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595922500336
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Continuous location (90B85) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Exact solution of the robust knapsack problem
- Improving the location of minisum facilities through network modification
- A branch and bound algorithm for the robust spanning tree problem with interval data
- Foundations of location analysis
- Reverse 2-median problem on trees
- The inverse Fermat-Weber problem
- Robust discrete optimization and its applications
- Some reverse location problems
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- Reverse selective obnoxious center location problems on tree graphs
- Variable-sized uncertainty and inverse problems in robust optimization
- Facility location problems with uncertainty on the plane
- The complexity analysis of the inverse center location problem
- An exact algorithm for the robust shortest path problem with interval data
- Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
- The minmax regret inverse maximum weight problem
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- Inverse median problems
- Robust inverse optimization
- Robust location problems with pos/neg weights on a tree
- Reverse 1-center problem on weighted trees
- Minimax regret path location on trees
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- 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
- Improving the location of minimax facilities through network modification
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- Further Study on Reverse 1-Center Problem on Trees
- A linear time algorithm for the reverse 1‐median problem on a cycle
- Reverse 1-centre problem on trees under convex piecewise-linear cost function
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
- Unnamed Item
- Unnamed Item
