The Base-matroid and Inverse Combinatorial Optimization Problems
暂无分享,去创建一个
[1] T. Moser. Shortest path calculation of seismic rays , 1991 .
[2] William H. Cunningham. On submodular function minimization , 1985, Comb..
[3] Cai Mao-cheng,et al. Inverse Problems of Matroid Intersection , 1999 .
[4] András Frank,et al. A Weighted Matroid Intersection Algorithm , 1981, J. Algorithms.
[5] Ravindra K. Ahuja,et al. Solving Inverse Spanning Tree Problems Through Network Flow Techniques , 1999, Oper. Res..
[6] Yanjun Li,et al. Inverse Matroid Intersection Problem , 1997, Math. Methods Oper. Res..
[7] D. R. Fulkerson,et al. Transversals and Matroid Partition , 1965 .
[8] Philippe L. Toint,et al. On an instance of the inverse shortest paths problem , 1992, Math. Program..
[9] Ravindra K. Ahuja,et al. Inverse Optimization , 2001, Oper. Res..
[10] Zhenhong Liu,et al. A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem , 1998, Discret. Appl. Math..
[11] Ravindra K. Ahuja,et al. Inverse Optimization, Part I: Linear Programming and General Problem , 1998 .
[12] James G. Oxley,et al. Matroid theory , 1992 .
[13] Yanjun Li,et al. Inverse Polymatroidal Flow Problem , 1999, J. Comb. Optim..
[14] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[15] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[16] Mao-cheng Cai. Inverse Problems of Matroid Intersection , 1999, J. Comb. Optim..