An Approach to Solving Linear Discrete Optimization Problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An Approach to Solving Linear Discrete Optimization Problems

Full text

Pdf (579 KB)

Source

Journal of the ACM (JACM) archive
Volume 17 , Issue 2 (April 1970) table of contents

Pages: 303 - 313

Year of Publication: 1970

ISSN:0004-5411

Author

Richard H. Roth

Bell Telephone Laboratories, Inc., Murray Hill, New Jersey and David Sarnoff Research Center, Princeton, N.J

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/321574.321584 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	BALAS, E. An additive algorithm for solving linear programs with zero-one variables. Oper. Res. 13 (July 1965), 517-546.
	2	--. Discrete programming by the filter method. Oper. Res. 15 (June 1967), 915-957.
	3	BALINSKI, M. L. Integer programming: Methods, uses, computation. Manage. Sci. 12 (Nov. 1965), 253-282.
	4	FREEMAN, R .J . Computational experience with the Balas integer programming algorithm. Rep. P-3241, Rand Corp., Santa Monica, Calif., Oct. 1965.
	5	GEEFRION, A. Integer programming by implicit enumeration and Balas' method. SIAM Rev. 9 (April 1967), 178-190.
	6	GLOVER, R. A multiphase dual algorithm for the zero-one integer programming problem. Oper.. Res. 13 (Nov. 1965), 879-919.
	7	HALDI, J. Twenty-five integer programming test problems. Rep. 43, Grad. School of Business, Stanford U., Stanford, Calif., 1964.
	8	LEMKE, C. E., AND SPIELBERG, K. Direct search algorithms for zero-one and mixedinteger programming. Oper. Res. 15 (June 1967), 892-914.
	9	LIN, S. Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44 (Dec. 1965), 2245-2269.
	10	REITER, S., AND SHERMAN, G. Discrete optimizing. SIAM J . 18 (Sept. 1965), 864-889.
	11	ROTR, R. Computer solutions to minimum cover problems. J. Oper. Res. 17 (May 1969), 455-465.
	12	SALKEN, H., AND SPIELDERG, K. Adaptive binary programming. Tech. Rep. #320-2951, IBM New York Scientific Center, June 1968, 90 pp.

CITED BY 2

	Walter H. Kohler , Kenneth Steiglitz, Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/ F , Journal of the ACM (JACM), v.22 n.1, p.106-114, Jan. 1975
	Sreerama K. Murthy , Simon Kasif , Steven Salzberg, A system for induction of oblique decision trees, Journal of Artificial Intelligence Research, v.2 n.1, p.1-32, August 1994