Inverse eccentric vertex problem on networks
DOI10.1007/S10100-014-0367-2zbMATH Open1339.90286OpenAlexW2092299890MaRDI QIDQ301951FDOQ301951
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
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
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)
Cites Work
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- Inverse combinatorial optimization: a survey on problems, methods, and results
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Inverse 1-center location problems with edge length augmentation on trees
- The complexity analysis of the inverse center location problem
- Inverse median problems
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Peripheral and eccentric vertices in graphs
- Eccentric sequences and eccentric sets in graphs
- Inverse Optimization
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Combinatorial algorithms for inverse network flow problems
Cited In (21)
- Title not available (Why is that?)
- Solving the absolute 1-center problem in the quickest path case
- Inverse quickest center location problem on a tree
- 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
- The inverse Voronoi problem in graphs. I: Hardness
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- Editorial
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR
- Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems
- A model for the inverse 1-Median problem on trees under uncertain costs
- The inverse 1-center problem on cycles with variable edge lengths
- Minimizing the expense transmission time from the source node to demand nodes
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
- On some inverse 1-center location problems
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
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)
