Author:
Ploskas Nikolaos,Samaras Nikolaos
Publisher
Springer International Publishing
Reference13 articles.
1. Bixby, R. E. (1992). Implementing the simplex method: The initial basis. ORSA Journal on Computing, 4, 267–284.
2. Carstens, D. M. (1968) Crashing techniques. In W. Orchard-Hays (Ed.), Advanced linear-programming computing techniques (pp. 131–139). New York: McGraw-Hill.
3. Gould, N. I. M., & Reid, J. K. (1989). New crash procedures for large systems of linear constraints. Mathematical Programming, 45, 475–501.
4. Maros, I., & Mitra, G. (1998). Strategies for creating advanced bases for large-scale linear programming problems. INFORMS Journal on Computing, 10, 248–260.
5. Paparrizos, K. (1991). An infeasible exterior point simplex algorithm for assignment problems. Mathematical Programming, 51(1–3), 45–54.