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