A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
暂无分享,去创建一个
[1] Nimrod Megiddo,et al. Towards a Genuinely Polynomial Algorithm for Linear Programming , 1983, SIAM J. Comput..
[2] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[3] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[4] J. Edmonds. Systems of distinct representatives and linear algebra , 1967 .
[5] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[6] András Frank,et al. An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..
[7] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[8] Éva Tardos,et al. A strongly polynomial minimum cost circulation algorithm , 1985, Comb..