The Bottleneck Traveling Salesman Problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis

Full text

Pdf (809 KB)

Source

Journal of the ACM (JACM) archive
Volume 25 , Issue 3 (July 1978) table of contents

Pages: 435 - 448

Year of Publication: 1978

ISSN:0004-5411

Authors

R. S. Garfinkel	Management Science Program, College of Business Administration, University of Tennessee, Knoxville, TN
K. C. Gilbert	Tennessee Valley Authority, Knoxville, TN

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 13, Downloads (12 Months): 60, Citation Count: 1

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/322077.322086 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	BELLMORE, M, AND MALONE, J C Pathology of travehng-salesman subtour ehmmatlon algorithms Oper Res 19 (197 l), 278-307
	2	C. Berge, Graphs and Hypergraphs, Elsevier Science Ltd, 1985
	3	EDMONDS, J, AND FULKERSON, D R Bottleneck extrema J Combinatorial Theory 8 (1970), 299-306
	4	FORD, L R, JR, AND FULKERSON, D R Flows m Networks Pnnceton U Press, Princeton, N.J, 1962
	5	FRANCIS, R.L, AND WHITE, J A Facthty Layout and Location An Analyttcal Approach. Prentice-Hall, Englewood Chffs, N J, 1974, Ch 9
	6	GARFINKEL, R S An improved algorithm for the bottleneck assignment problem Oper Res 19 (1971), 1747-1751
	7	GARFINKEL, R S On partmonmg the feasible set m a branch-and-bound algorithm for the asymmetric travehng salesman problem Oper Res 21 (1973), 340-343
	8	GARFINKEL, R S, AND NEMHAUSER, G L Optimal polmcal districting by lmphot enumeration techniques Manage Scl 16 (1970), 495-508
	9	GARFINKEL, R S, AND RAO, M R The bottleneck transportation problem Naval Res Logtst Quart 18 (1971 ), 465-472
	10	GILBERT, K C The bottleneck travehng salesman problem Unpub doct d~ss, U of Tennessee, Knoxvdle, Tenn, 1976
	11	GILMORE, P C, AND GOMORV, R E Sequencing a one state-variable machine A solvable case of the travehng salesman problem Res Paper RC-1103, IBM Thomas J Watson Research Center, Yorktown Heights, N Y, 1964
	12	HAMMER, P L Time mmunlzmg transportation problems Naval Res Logtst Quart 16 (1969), 487-490
	13	HELD, M, AND KARP, R M The travehng-salesman problem and mlmmum spanmng trees Oper Res 18 (1970), 1138-1162
	14	HELD, M, AND KARP, R M The travehng-salesman problem and mlmmum spannmg trees Part II Math Programming 1 ( 1971), 6-25
	15	KARP, R M. Reduclbihty among combinatorial problems. In Complexaty of Computer Computatwns, R E Miller and J.W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 85-104.
	16	MooN, J. W. Almost all graphs have a spanning cycle. Canad. Math Bull. 15 (1972), 39-41.
	17	SwAp, c, W Some remarks on the time transportation problem Naval Res Logtst Quart 18 (1971), 473-487