Some reverse location problems

European Journal of Operational Research

Volumn 124, Issue 1, 2000, Pages 77-88

  Zhang, Jianzhong ^a   Liu, Zhenhong ^b   Ma, Zhongfan ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b INSTITUTE OF SYSTEMS SCIENCE   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUDGET CONTROL; COST BENEFIT ANALYSIS; PROBLEM SOLVING; TREES (MATHEMATICS);

LOCATION THEORY; MINMAX CRITERION; TREE NETWORK;

OPERATIONS RESEARCH;

EID: 0034230877     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00122-8     Document Type: Article

References (21)

1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. Berman O., Ingco D.I., Odoni A.R. Improving the location of minsum facility through network modification. Annals of Operations Research. 40:1992;1-16.
3. Berman O., Ingco D.I., Odoni A.R. Improving the location of minmax facility through network modification. Networks. 24:1994;31-41.
4. Burton D., Toint Ph.L. On an instance of the inverse shortest paths problem. Mathematical Programming. 53:1992;45-61.
5. Burton D., Toint Ph.L. On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Mathematical Programming. 63:1994;1-22.
6. Cai M., Li Y. Inverse matroid intersection problem. ZOR Mathematical Methods of Operations Research. 45:1997;235-243.
7. M. Cai, X. Yang, Y. Li, Inverse polymatroidal flow problem, Journal of Combinatorial Optimization, to appear.
8. Hu Z., Liu Z. A strongly polynomial algorithm for the inverse arborescence problem. Discrete Applied Mathematics. 82:1998;135-154.
9. Q. Wei, J. Zhang, X. Zhang, An inverse DEA model for inputs/outputs estimation, European Journal of Operational Research, to appear.
10. Yang C., Zhang J. Inverse maximum flow and minimum cut problems. Optimization. 40:1997;147-170.
11. Yang C., Zhang J. Inverse maximum capacity problem. Operations Research Spektrum. 20:1998;97-100.
12. Yang C., Zhang J. A Constrained capacity expansion problem on networks. International Journal of Computer Mathematics. 70:1998;19-33.
13. Yang C., Zhang J. Two general methods for inverse optimization problems. Applied Mathematics Letters. 12(2):1999;69-72.
14. Zhang J., Cai M. Inverse problem of minimum cuts. ZOR Mathematical Methods of Operations Research. 48:1998;51-58.
15. Zhang J., Liu Z. Calculating some inverse linear programming problem. Journal of Computational and Applied Mathematics. 72:1996;261-273.
16. 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.
17. J. Zhang, Z. Liu, Z. Ma, Inverse fractional matching problem, Journal of the Australian Mathematical Society B: Applied Mathematics, to appear.
18. Zhang J., Ma Z. A network flow method for solving some inverse combinatorial optimization problems. Optimization. 37:1996;59-72.
19. J. Zhang, Z. Ma, Solution structure of some inverse optimization problems, Journal of Combinatorial Optimization 3 (1) (1999).
20. 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.
21. Zhang J., Xu S., Ma Z. An algorithm for inverse minimum spanning tree problem. Optimization Methods and Software. 8:1997;69-84.