A Direct Descent Binary Knapsack Algorithm

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Direct Descent Binary Knapsack Algorithm

Full text

Pdf (433 KB)

Source

Journal of the ACM (JACM) archive
Volume 25 , Issue 2 (April 1978) table of contents

Pages: 304 - 311

Year of Publication: 1978

ISSN:0004-5411

Author

Andris A. Zoltners

Graduate School of Management, Northwestern University, Evanston, IL

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references 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/322063.322073 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	BARR, R S, AND ROSS, G T A hnked list data structure for a bmary knapsack algorithm Res. Pep. CCS 232, Ctr for Cybernet Stud, U of Texas, Austin, Texas, Aug 1975.
	2	CABOT, A V An enumeration algorithm for knapsack problems Oper Res 18 (1970), 306-311
	3	DEMBO, R S, AND HAMMER, P L A reduction algorithm for knapsack problems. Res. Rep. CORR 75- 6, Dept of Combmatoncs and Optimization, U of Waterloo, Waterloo, Ont , March 1975
	4	BAYARD, D, AND PLATEAU, G Resolution of the 0-1 knapsack problem: Comparison of methods Math Programmlng 8 (1975), 272-307
	5	FIsr, J C An Initial bounding procedure for use with 0-1 single knapsack algorithms. Working Paper, State U of New York, Albany, N Y , 1975
	6	GREENBERG, H, AND HEGERICH, R L A branch search algorithm for the knapsack problem. Manage Scz 16, 5 (1970), 327-332
	7	Ellis Horowitz , Sartaj Sahni, Computing Partitions with Applications to the Knapsack Problem, Journal of the ACM (JACM), v.21 n.2, p.277-292, April 1974 [doi>10.1145/321812.321823]
	8	INGARGIOLA, G P, AND KORSH, J F Reduction algorithm for zero-one single knapsack problems Manage Scl 20, 4 (1973), 460-463
	9	KOLESAR, P J A branch and bound algorithm for the knapsack problem Manage. Sct 13, 9 (1967), 723-735
	10	NAUSS, R M An efficient algorithm for the 0-1 knapsack problem Manage Scz. 23, 1 (1976), 27-31
	11	Ross, G T, SOLAND, R M, AND ZOLTNERS, A A A note on the bounded interval generalized assignment problem Res Rep CCS253, Ctr for Cybernet Stud , U. of Texas, Austin, Texas, July 1976
	12	Sartaj Sahni, Approximate Algorithms for the 0/1 Knapsack Problem, Journal of the ACM (JACM), v.22 n.1, p.115-124, Jan. 1975 [doi>10.1145/321864.321873]