Reverse center location problem?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1741, Issue , 1999, Pages 279-294

  Zhang, Jianzhong ^a   Yang, Xiaoguang ^b   Cai, Mao Cheng ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b INSTITUTE OF SYSTEMS SCIENCE   (China)

Author keywords

Maximum cost circulation; Networks and graphs; NP hard; Relaxation; Satisfiability problem

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; LOCATION;

CENTER LOCATION PROBLEM; MIXED INTEGER PROGRAMMING; NETWORKS AND GRAPHS; NP-HARD; RELAXATION; SATISFIABILITY PROBLEMS; SPANNING TREE; STRONGLY POLYNOMIALS;

PROBLEM SOLVING;

EID: 84958044359     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_29     Document Type: Conference Paper

References (27)

1. Burton, D., Pulleyblank, W.R., Toint, Ph.L.: The inverse shortest paths with upper bounds on shortest path costs. Report 93/03, (1993), Department of Mathematics, Facultes, Univeristaires ND de la Paix, B-5000 Nemur, Belgium
2. Burton, D., Toint, Ph.L.: On an instance of the inverse shortest paths problem. Mathematical Programming 53 (1992) 45-61
3. Cai, M., Li, Y.: Inverse matroid intersection problem. ZOR Mathematical Methods of Operations Research 45 (1997) 235-243
4. Cai, M., Yang, X., Zhang, J.: The complexity analysis of the inverse center location problem. Journal of Global Optimization (to appear)
5. Christofides, N.: Graph Theory: An Algorithmic Approach. Academic Press Inc. (London) Ltd, (1975)
6. Cook, S.A.: The complexity of theorem proving procedures. Proc. 3rd ACM Symp. on the Theory of Computing, ACM(1971), 151-158
7. Fekete, S., Kromberg, S., Hochstattler, W., Moll, C.: The Complexity of an Inverse Shortest Paths Problem. Working paper (1993), University of Cologne.
8. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide of the Theory of NP-Completeness. Freeman, San Francisco, (1979)
9. Grötschel, M., Jünger, M., Reinelt, G.: On the acyclic subgraph polytope. Mathematical Programming 33 (1985) 28-42
10. Hochbaum D. (eds.): Approximation Algorithms for NP-hard Problems. PWS, Boston, 1997
11. Hu, Z., Liu, Z.: A strongly polynomial algorithm for the inverse shortest arborescence problem. Discrete Applied Mathematics 82 (1998) 135-154
12. Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, (1976)
13. Leung, L.: A graph-theoretic heuristic for designing loop-layout manufacturing systems. European Journal of Operational Research, 57 (1992) 243-252
14. th ACM Symp. on the Theory of Comp., (1988), 377-387
15. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall Inc. Englewood Clifis, New Jersey, (1982)
16. Tardos, É.: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5 (1985) 247-255
17. Yang, C., Zhang, J.: Inverse maximum flow and minimum cut problems. Optimization 40 (1997) 147-170
18. Yang, C., Zhang, J.: Inverse maximum capacity problem. Operations Research Spektrum (to appear)
19. Yang, C., Zhang, J.: Two general methods for inverse optimization problems. Applied Mathematics Letters (to appear)
20. Zhang, J., Cai, M.: Inverse problem of minimum cuts. ZOR Mathematical Methods of Operations Research 48 (1998) 51-58
21. Zhang, J., Liu, Z.: Calculating some inverse linear programming problem. Journal of Computational and Applied Mathematics 72 (1996) 261-273
22. Zhang, J., Liu, Z., Ma, Z.: On inverse problem of minimum spanning tree with partition constraints. ZOR Mathematical Methods of Operations Research 44 (1996) 347-358
23. Zhang, J., Liu, Z., Ma, Z.: Inverse Fractional Matching Problem. The Journal of Australia Mathematics Society, Ser. B: Applied Mathematics (to appear)
24. Zhang, J., Ma, Z.: A network flow method for solving some inverse combinatorial optimization problems. Optimization 37 (1996) 59-72
25. Zhang, J., Ma, Z.: Solution structure of some inverse optimization problems. Journal of Combinatorial Optimization (to appear)
26. Zhang, J., Ma, Z., Yang, C.: A column generation method for inverse shortest path problem. ZOR Mathematical Methods of Operations Research 41 (1995) 347-358
27. Zhang, J., Xu, S., Ma, Z.: An algorithm for inverse minimum spanning tree problem. Optimization Methods and Software 8 (1997) 69-84