Inverse matroid intersection problem

Mathematical Methods of Operations Research

Volumn 45, Issue 2, 1997, Pages 235-243

  Cai, Mao Cheng ^a   Yanjun, L I ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

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

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; FUNCTIONS; NUMERICAL METHODS; OPTIMIZATION; SET THEORY;

INVERSE MATROID INTERSECTION PROBLEM; MINIMUM COST CIRCULATION; STRONGLY POLYNOMIAL ALGORITHM;

INVERSE PROBLEMS;

EID: 0030644203     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01193863     Document Type: Article

References (15)

1. Burton D, Toint PhL (1992) On an instance of the inverse shortest paths problem. Mathematical Programming 53:45-61
2. Cai M, Yang X (1995) Inverse shortest path problems. Proc. Internat. Symp. on Operations Research with Applications in Technology and Management, ISORA'95, Beijing: 242-248
3. Ford LR, Fulkerson DR (1962) Flows in Networks. Princeton University Press, Princeton, N.J.
4. Frank A (1981) A weighted matroid intersection algorithm. J. Algorithms 2:328-336
5. Hu Z, Liu Z (1994) A strongly polynomial algorithm for the inverse shortest arborescence problem. Working paper, Institute of Systems Science, Academia Sinica, Beijing, China
6. Huang S, Liu Z (1994) On the inverse problem of k-matching of bipartite graph. Working paper, Department of Management, School of Business and Management, Hong Kong University of Science and Technology
7. Lawler EL (1976) Combinatorial optimization: Networks and matroids. Holt, Rinehart and Winsteon, New York
8. Ma Z, Xu S, Zhang J (1994) Algorithms for inverse minimum spanning tree problem, Working paper, Department of Mathematics, City Polytechnic of Hong Kong
9. Ma Z, Zhang J (1995) On inverse combinatorial optimization problems. Working paper, Department of Mathematics, City Polytechnic of Hong Kong
10. Orlin JB (1988) A faster strongly polynomial minimum cost flow algorithm. Proc. 20th ACM Symp. on the Theory of Comp.: 377-387
11. Papadimitriou H, Steiglitz K (1982) Combinatorial optimization: Algorithms and complexity. Prentice-Hall, Englewood Cuffs, N.J.
12. Tardos E (1985) A strongly polynomial minimum cost circulation algorithm. Combinatorica 5:247-255
13. Tardos E (1986) A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34:250-256
14. Xu S, Zhang J (1995) An inverse problem of the weighted shortest path problem. Japan J. Indust. Appl. Math. 12:47-59
15. Zhang J, Ma Z, Yang C (1995) A column generation method for inverse shortest path problems. ZOR - Mathematical Methods of Operations Research 41:347-358