Inverse Problems of Matroid Intersection

Journal of Combinatorial Optimization

Volumn 3, Issue 4, 1999, Pages 465-474

  Cai, Mao Cheng ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Inverse problem; Matroid intersection; Minimum cost circulation; Strongly polynomial algorithm

Indexed keywords

EID: 0041542941     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1009883605691     Document Type: Article

References (15)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall: NJ, 1993.
2. D. Burton and Ph.L. Toint, "On an instance of the inverse shortest paths problem," Mathematical Programming, vol. 53, pp. 45-61, 1992.
3. A. Frank, "An algorithm for submodular functions on graphs," Annals of Discrete Mathematics, vol. 16, pp. 97-120, 1982.
4. A.V. Goldberg, E. Tardos, and R.E. Tarjan, "Network flow algorithms," Technical Report STAN-CS-89-1252, Department of Computer Science, Stanford University, Stanford, CA, March 1989.
5. M. Grötschel, L. Lovasz, and A. Schrijver, Geometric Algorithm and Combinatorial Optimization, Springer: Berlin, 1993.
6. Z. Hu and Z. Liu, "A strongly polynomial algorithm for the inverse shortest arborescence problem," Discrete Appl. Math., vol. 82, pp. 135-154, 1998.
7. S. Huang and Z. Liu, "On the inverse problem of k-matching of bipartite graph," to appear in European J. Operations Research. E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt Rinehart Winston: New York, 1976.
8. J.B. Orlin, "A Faster Strongly Polynomial Minimum Cost Flow Algorithm," in Proc. 20th ACM Symp. on the Theory of Comp, 1988, pp. 377-387.
9. A. Recski, Matroid Theory and its Applications, Springer: Berlin, 1989.
10. É. Tardos, "A strongly polynomial minimum cost circulation algorithm," Combinatorica, vol. 5, pp. 247-255, 1985.
11. É. Tardos, "A strongly polynomial algorithm to solve combinatorial linear programs," Operations Research, vol. 34, pp. 250-256, 1986.
12. D. Welsh, Matroid Theory, Academic Press: London, 1976.
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," ZOR Mathematical Methods of Operations Research, vol. 41, pp. 347-358, 1995.
15. J. Zhang, S. Xu, and Z. Ma, "An algorithms for inverse minimum spanning tree problem," Optimization Methods and Software, vol. 8, pp. 69-84, 1997.