Optimal algorithms for inverse eccentric vertex location problem on extended star networks
DOI10.1142/S0217595921500019zbMATH Open1478.90020OpenAlexW3123278870MaRDI QIDQ5013391FDOQ5013391
Authors: Mehran Hasanzadeh, Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi 
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
Recommendations
- Inverse eccentric vertex problem on networks
- Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks
- Inverse eccentric vertex problem on trees
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Introduction to algorithms
- Theory and Applications of Satisfiability Testing
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse 1-center location problems with edge length augmentation on trees
- Inverse eccentric vertex problem on networks
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- 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
- Peripheral and eccentric vertices in graphs
- Eccentric sequences and eccentric sets in graphs
- Inverse Optimization
- Combinatorial algorithms for inverse network flow problems
- On an instance of the inverse shortest paths problem
- Weighted inverse minimum spanning tree problems under Hamming distance
- Calculating some inverse linear programming problems
- Capacity inverse minimum cost flow problem
- 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
- Inverse minimum cost flow problems under the weighted Hamming distance
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Solving inverse spanning tree problems through network flow techniques
- The inverse 1-center problem on cycles with variable edge lengths
- Inverse quickest center location problem on a tree
- On some inverse 1-center location problems
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Weighted inverse maximum perfect matching problems under the Hamming distance
- Further study on reverse 1-center problem on trees
- Inverse eccentric vertex problem on trees
- Inverse maximum flow problems under the combining norms
Cited In (3)
This page was built for publication: Optimal algorithms for inverse eccentric vertex location problem on extended star networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013391)
