Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Avis, D., Chvátal, V.: Notes on Bland’s pivoting rule. In: Polyhedral Combinatorics, Mathematical Programming Studies, vol. 8, pp. 24–34. Springer, Heidelberg (1978), http://dx.doi.org/10.1007/BFb0121192
2. Bertsekas, D.: Dynamic programming and optimal control, 2nd edn. Athena Scientific, Singapore (2001)
3. Bhat, G.S., Savage, C.D.: Balanced gray codes. Electronic Journal of Combinatorics 3, 2–5 (1996)
4. Broder, A., Dyer, M., Frieze, A., Raghavan, P., Upfal, E.: The worst-case running time of the random simplex algorithm is exponential in the height. Inf. Process. Lett. 56(2), 79–81 (1995)
5. Dantzig, G.: Linear programming and extensions. Princeton University Press, Princeton (1963)
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献