Inverse eccentric vertex problem on networks

DOI10.1007/S10100-014-0367-2zbMath1339.90286OpenAlexW2092299890MaRDI QIDQ301951

Kien Trung Nguyen, André B. Chassein

Publication date: 4 July 2016

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-014-0367-2

zbMATH Keywords

treecycleinverse optimization problemcactuseccentric vertex

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (18)

Solving the absolute 1-center problem in the quickest path case ⋮ On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks ⋮ Inverse 1-median problem on block graphs with variable vertex weights ⋮ The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ On some inverse 1-center location problems ⋮ The inverse 1-center problem on cycles with variable edge lengths ⋮ Inverse \(k\)-centrum problem on trees with variable vertex weights ⋮ Inverse quickest center location problem on a tree ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ Editorial ⋮ A model for the inverse 1-median problem on trees under uncertain costs ⋮ Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR ⋮ Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

Cites Work

• Unnamed Item
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• Inverse 1-center location problems with edge length augmentation on trees
• Peripheral and eccentric vertices in graphs
• Eccentric sequences and eccentric sets in graphs
• The complexity analysis of the inverse center location problem
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse median problems
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Inverse Optimization
• Efficient Algorithms for the Inverse Spanning-Tree Problem
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Combinatorial algorithms for inverse network flow problems
• Theory and Applications of Satisfiability Testing

This page was built for publication: Inverse eccentric vertex problem on networks