Inverse eccentric vertex problem on networks

DOI10.1007/S10100-014-0367-2zbMATH Open1339.90286OpenAlexW2092299890MaRDI QIDQ301951FDOQ301951

Authors Kien Trung Nguyen, André 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

treecactuscycleeccentric vertexinverse optimization problem

Mathematics Subject Classification ID

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

Recommendations

• Inverse eccentric vertex problem on trees
• Optimal algorithms for inverse eccentric vertex location problem on extended star networks
• The inverse 1-maxian problem with edge length modification
• Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
• The inverse 1-center problem on cycles with variable edge lengths

Cites work

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

Cited in

(23)

• Optimal algorithms for inverse vertex obnoxious center location problems on graphs
• scientific article; zbMATH DE number 1863555 (Why is no real title available?)
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
• A model for the inverse 1-Median problem on trees under uncertain costs
• Inverse quickest center location problem on a tree
• Solving the absolute 1-center problem in the quickest path case
• Inverse 1-median problem on block graphs with variable vertex weights
• Minimizing the expense transmission time from the source node to demand nodes
• Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR
• Linear time optimal approaches for reverse obnoxious center location problems on networks
• On some inverse 1-center location problems
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
• Inverse eccentric vertex problem on trees
• Editorial
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• The inverse 1-center problem on cycles with variable edge lengths
• Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
• Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
• The inverse Voronoi problem in graphs. I: Hardness
• Inverse \(k\)-centrum problem on trees with variable vertex weights
• On fixed-parameter solvability of the minimax path location problem
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301951)