- BazaraaM.S. and SheraliH.D. (1981). A versatile scheme for ranking the extreme points of an assignment polytope. Naval Research Logistics Quarterly, 28, 545–557.
- BeardwoodJ., HaltonJ.H., and HammersleyJ.M. (1959). The shortest path through many points. Proceedings of the Cambridge Philosophical Soceity, 299–327.
- BellmoreM. and NemhauserG.L. (1968). The traveling salesman problem: A survey. Operations Research, 16. 538–558.
- ChristofidesN. (1975). Graph Theory, An Algorithmic Approach. Academic Press, New York.
- EastmanW.L. (1958). Linear Programming With Pattern Constraints. Ph.D. Dissertation. Harvard University, BostonMassachusetts.
- KarpR.M., (1977). Probabilistic analyses of partitioning algorithms for the traveling-salesman problem in the plane. Mathematics of Operations Research, 2, 209–224.
- LittleJ.D.C., MurtyK.G., SweeneyD.W., and KarelC. (1963). An algorithm for the traveling salesman problem. Operations Research, 11, 972–989.
- MurtyK.G. (1968). An algorithm for ranking all the assignments in order of increasing cost. Operations Research, 16, 682–687.
- PanayiotopoulosJ.C. (1982). Probabilistic analysis of solving the assignment problem for the traveling salesman problem. European Journal of Operational Research, 9, 77–82.
- ShapiroD. (1966). Algorithms for the solution of the optimal cost traveling salesman problem. Sc. D. Thesis, Washington University, St. LouisMissouri.
- Choose new content alerts to be informed about new research of interest to you
- Easy remote access to your institution's subscriptions on any device, from any location
- Save your searches and schedule alerts to send you new results
- Export your search results into a .csv file to support your research
![Supercharge Your Next Research Paper: Research and write your next paper with Jenni AI.]({"type":"image" , "src" : "/sda/112445/Skyscraper-econ.png"})