Solution Structure of Some Inverse Combinatorial Optimization Problems

Journal of Combinatorial Optimization

Volumn 3, Issue 1, 1999, Pages 127-139

  Zhang, Jianzhong ^a   Ma, Zhongfan ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b INSTITUTE OF SYSTEMS SCIENCE   (China)

Author keywords

Blocking and anti blocking polyhedra; Inverse problem; Maximum weight matching; Minimum spanning tree; Shortest path

Indexed keywords

EID: 0002141311     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009829525096     Document Type: Article

References (15)

1. D. Burton and Ph.L. Toint, "On an instance of the inverse shortest paths problem," Mathematical Programming, vol. 53, pp. 45-61, 1992.
2. M. Cai and Y. Li, "Inverse matroid intersection problem," Zeitschrift für Operations Research, vol. 45, pp. 235-243, 1997.
3. D.R. Fulkerson, Blocking polyhedra, in Graph Theory and its Applications, B. Harris (Ed.), Academic Press: New York, 1970, pp. 93-112.
4. D.R. Fulkerson, "Blocking and anti-blocking pairs of polyhedra," Mathematical Programming, vol. 1, pp. 168-194, 1971.
5. G.L. Nemhauser, Integer and Combinatorial Optimization, Wiley: New York, 1988.
6. A. Schrijver, Theory of Linear and Integer Programming, Wiley: Chichester, 1986.
7. S. Xu and J. Zhang, "An inverse problem of the weighted shortest path problem," Japan Journal of Industrial and Applied Mathematics, vol. 12, pp. 47-59, 1995.
8. C. Yang, J. Zhang, and Z. Ma, "Inverse maximum flow and minimum cut problems," Optimization, vol. 40, pp. 147-170, 1997.
9. J. Zhang and Z. Liu, "Calculating some inverse linear programming problems," Journal of Computational and Applied Mathematics, vol. 72, pp. 261-273, 1996.
10. J. Zhang, Z. Liu, and Z. Ma, "On the inverse problem of minimum spanning tree with partition constraints," Zeitschrift fir Operations Research, vol. 44, pp. 171-187, 1996.
11. J. Zhang and Z. Ma, "A study of inverse shortest path problem by block theory," Research Report MA-93-11, City University of Hong Kong, Hong Kong, 1993a.
12. J. Zhang and Z. Ma, "On some inverse combinatorial optimization problems," Research Report MA-93-12, City University of Hong Kong, Hong Kong, 1993b.
13. J. Zhang and Z. Ma, "A network flow method for solving some inverse combinatorial optimization problems," Optimization, vol. 37, pp. 59-72, 1996.
14. J. Zhang, Z. Ma, and C. Yang, "A column generation method for inverse shortest path problems," Zeitschrift für Operations Research, vol. 41, pp. 347-358, 1995.
15. J. Zhang, S. Xu, and Z. Ma, "An algorithm for inverse minimum spanning tree problem," Optimization Methods and Software, vol. 8, pp. 69-84, 1997.