Constraint Optimal Selection Techniques (COSTs) for Linear Programming
暂无分享,去创建一个
[1] Jay M. Rosenberger,et al. Constraint Optimal Selection Techniques (COSTs) for nonnegative linear programming problems , 2015, Appl. Math. Comput..
[2] Jay M. Rosenberger,et al. The cosine simplex algorithm , 2006 .
[3] Marcos Pereira Estellita Lins,et al. An improved intial basis for the simplex algorithm , 2005 .
[4] George L. Nemhauser,et al. Rerouting Aircraft for Airline Recovery , 2003, Transp. Sci..
[5] Norman D. Curet,et al. A primal-dual simplex method for linear programs , 1993, Oper. Res. Lett..
[6] Pingqi Pan,et al. Practical finite pivoting rules for the simplex method , 1990 .
[7] D. Myers,et al. A constraint selection technique for a class of linear programs , 1988 .
[8] Richard M. Karp,et al. A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only , 1986, Math. Oper. Res..
[9] Stanley Zionts,et al. Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems , 1966 .
[10] J. J. Stone,et al. THE CROSS-SECTION METHOD, AN ALGORITHM FOR LINEAR PROGRAMMING , 1958 .
[11] Marcos Pereira Estellita Lins,et al. An improved initial basis for the Simplex algorithm , 2005, Comput. Oper. Res..
[12] Pingqi Pan. A simplex-like method with bisection for linear programming 1 , 1991 .
[13] MILAN ZELENY,et al. An external reconstruction approach (ERA) to linear programming , 1986, Comput. Oper. Res..
[14] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .
[15] Arch W. Naylor,et al. Linear Operator Theory in Engineering and Science , 1971 .