Review of "Computational Techniques of the Simplex Method by István Maros", Kluwer Academic Publishers, 2003

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Review of "Computational Techniques of the Simplex Method by István Maros", Kluwer Academic Publishers, 2003

Full text

Pdf (538 KB)

Source

ACM SIGACT News archive
Volume 38 , Issue 3 (September 2007) table of contents

REVIEWS: Book review table of contents

Pages: 27 - 30

Year of Publication: 2007

ISSN:0163-5700

Author

Brian Borchers

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 16, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1324215.1324222 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Robert E. Bixby, Solving Real-World Linear Programs: A Decade and More of Progress, Operations Research, v.50 n.1, p.3-15, January 2002 [doi>10.1287/opre.50.1.3.17780]
	2	N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, v.4 n.4, p.373-395, Dec. 1984 [doi>10.1007/BF02579150]
	3	L. G. Khachian. A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20:191--194, 1979.
	4	V. Klee and G. J. Minty. How good is the simplex method? In O. Shisha, editor, Inequalities-III, pages 159--175. Academic Press, New York, 1972.
	5	C. Lemke. The dual method of solving the linear programming problem. Naval Research Logistics Quarterly, 1:36--47, 1954.
	6	B. Murtagh. Advanced Linear Programming: Computation and Practice. McGraw-Hill, New York, 1981.
	7	W. Orchard-Hays. Advanced Linear-Programming Computing Techniques. McGraw-Hill, New York, 1968.