Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
暂无分享,去创建一个
Robert E. Bixby | Roy E. Marsten | David F. Shanno | Irvin Lustig | John W. Gregory | I. Lustig | R. E. Marsten | D. Shanno | R. Bixby | J. W. Gregory
[1] Malcolm C. Harrison,et al. Data-structures and programming , 1972 .
[2] D. Goldfarb. USING THE STEEPEST-EDGE SIMPLEX ALGORITHM TO SOLVE SPARSE LINEAR PROGRAMS , 1976 .
[3] Donald Goldfarb,et al. A practicable steepest-edge simplex algorithm , 1977, Math. Program..
[4] Roy E. Marsten,et al. The Design of the XMP Linear Programming Library , 1981, TOMS.
[5] John K. Reid,et al. A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases , 1982, Math. Program..
[6] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[7] Mauricio G. C. Resende,et al. Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm , 1989, INFORMS J. Comput..
[8] Ira Gershkoff,et al. Optimizing Flight Crew Schedules , 1989 .
[9] J F Barutt,et al. AIRLINE CREW SCHEDULING : SUPERCOMPUTERS AND ALGORITHMS , 1990 .
[10] John J. H. Forrest,et al. Vector processing in simplex and interior methods for linear programming , 1990 .
[11] Nimrod Megiddo,et al. On Finding Primal- and Dual-Optimal Bases , 1991, INFORMS J. Comput..
[12] Robert E. Bixby,et al. Implementing the Simplex Method: The Initial Basis , 1992, INFORMS J. Comput..
[13] Roy E. Marsten,et al. On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..