A strongly polynomial minimum cost circulation algorithm
Combinatorica
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On an instance of the inverse shortest paths problem
Mathematical Programming: Series A and B
Calculating some inverse linear programming problems
Journal of Computational and Applied Mathematics
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
A strongly polynomial algorithm for the inverse shortest arborescence problem
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity Analysis of the Inverse Center Location Problem
Journal of Global Optimization
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
| Hi-index | 0.00 |
In this paper we consider a reverse center location problem in which we wish to spend as less cost as possible to ensure that the distances from a given vertex to all other vertices in a network are within given upper bounds. We first show that this problem is NP-hard. We then formulate the problem as a mixed integer programming problem and propose a heuristic method to solve this problem approximately on a spanning tree. A strongly polynomial method is proposed to solve the reverse center location problem on this spanning tree.