The Complexity Analysis of the Inverse Center Location Problem

Journal of Global Optimization

Volumn 15, Issue 2, 1999, Pages 213-218

  Cai, M C ^a   Yang, X G ^a   Zhang, J Z ^b  

^a INSTITUTE OF SYSTEMS SCIENCE   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Complexity; Location problem; Networks and graphs; Satisfiability problem

Indexed keywords

EID: 0002138917     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008360312607     Document Type: Article

References (9)

1. Burton, D. and Toint, Ph.L., (1992). On an instance of the inverse shortest paths problem, Mathematical Programming, 53: 45-61.
2. Burton, D., Pulleyblank, B. and Toint, Ph.L. (1997). The inverse shortest path problem with upper bounds on shortest path costs, in Network Optimization, edited by P.M. Pardalos, D.H. Hearn and W.H. Hager, Lecture Notes in Economics and Mathematical Systems 450: 156-171.
3. Zhang, J.Z. and Liu, Z.H. (1996). Calculating some inverse linear programming problems, J. Computational and Applied Mathematics 72: 261-273.
4. Zhang, J.Z. and Ma, Z.F. (1996). A network flow method for solving some inverse combinatorial optimization problems, Optimization 37: 59-72.
5. Cai, M.C. and Li, Y.J. (1997). Inverse matroid intersection problem, ZOR Math. Meth. Oper. Res. 45: 235-243.
6. Yang, C. and Zhang, J. Z. (1999). Two general methods for inverse optimization problems, Appl. Math. Lett. 12(2): 69-72.
7. Christofides, N. (1975). Graph Theory: An Algorithmic Approach, Academic Press, London.
8. Papadimitriou, C.H. and Steiglitz, K. (1982). Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, New Jersey.
9. Cook, S.A. (1971). The complexity of theorem proving procedures, Proceedings of the 3rd ACM Symposium on the Theory of Computing, 151-158.