Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks
DOI10.1142/S0217595921500019zbMath1478.90020OpenAlexW3123278870MaRDI QIDQ5013391
Mehran Hasanzadeh, Fahimeh Baroughi, Esmaeil Afrashteh, Behrooz Alizadeh
Publication date: 30 November 2021
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595921500019
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inverse eccentric vertex problem on networks
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Inverse minimum cost flow problems under the weighted Hamming distance
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- Inverse 1-center location problems with edge length augmentation on trees
- On an instance of the inverse shortest paths problem
- Peripheral and eccentric vertices in graphs
- Eccentric sequences and eccentric sets in graphs
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- The inverse 1-center problem on cycles with variable edge lengths
- Inverse quickest center location problem on a tree
- Weighted inverse minimum spanning tree problems under Hamming distance
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Calculating some inverse linear programming problems
- Weighted inverse maximum perfect matching problems under the Hamming distance
- Capacity inverse minimum cost flow problem
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Note on ``Inverse minimum cost flow problems under the weighted Hamming distance
- Some inverse optimization problems under the Hamming distance
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Inverse Optimization
- Combinatorial algorithms for inverse network flow problems
- Further Study on Reverse 1-Center Problem on Trees
- Theory and Applications of Satisfiability Testing
- On some inverse 1-center location problems
- Inverse Maximum Flow Problems under the Combining Norms
This page was built for publication: Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks
