Optimal algorithms for inverse eccentric vertex location problem on extended star networks

DOI10.1142/S0217595921500019MaRDI QIDQ5013391zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

combinatorial optimizationinverse optimizationtime complexityeccentric vertex location problem

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Calculating some inverse linear programming problems
• Capacity inverse minimum cost flow problem
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Combinatorial algorithms for inverse network flow problems
• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Eccentric sequences and eccentric sets in graphs
• Further study on reverse 1-center problem on trees
• Introduction to algorithms
• Inverse 1-center location problems with edge length augmentation on trees
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
• Inverse Optimization
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse eccentric vertex problem on networks
• Inverse eccentric vertex problem on trees
• Inverse maximum flow problems under the combining norms
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
• Inverse minimum cost flow problems under the weighted Hamming distance
• Inverse quickest center location problem on a tree
• Note on ``Inverse minimum cost flow problems under the weighted Hamming distance
• On an instance of the inverse shortest paths problem
• On some inverse 1-center location problems
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• Peripheral and eccentric vertices in graphs
• Solving inverse spanning tree problems through network flow techniques
• Some inverse optimization problems under the Hamming distance
• The inverse 1-center problem on cycles with variable edge lengths
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• Theory and Applications of Satisfiability Testing
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• Weighted inverse maximum perfect matching problems under the Hamming distance
• Weighted inverse minimum spanning tree problems under Hamming distance

Cited in

(3)

• Inverse eccentric vertex problem on networks
• Inverse eccentric vertex problem on trees
• Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks

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)