A search algorithm for the traveling salesman problem
References (13)
- et al.
The traveling salesman problem: a survey
Ops Res.
(1968) Traveling salesman problem—a survey of theoretical developments and applications
Opsearch
(1968)- et al.
On the relation between the travelling salesman and longest path problems
Ops Res.
(1962) Some observations on the longest path problem
Ops Res.
(1964)A lexicographic search approach to traveling salesman problem
A general algorithm for the n × M flowshop scheduling problem
Int. J. Prod. Res.
(1968)
Cited by (6)
A computerised vehicle routing system for refuse collection
1990, Advances in Engineering Software (1978)Scheduling in a manufacturing shop with sequence-dependent setups
1989, Robotics and Computer Integrated ManufacturingRouting and scheduling of vehicles and crews. The state of the art
1983, Computers and Operations ResearchJoint Optimal Power Source Sizing and Data Collection Trip Planning for Advanced Metering Infrastructure Enabled by Unmanned Aerial Vehicles
2022, Journal of Modern Power Systems and Clean EnergyThe use of nested hulls in the symmetric traveller problem
1998, Engineering Optimization
- ∗
Jatinder N. D. Gupta is currently General Manager, Information Technology Division, MIS Department, U.S. Postal Service, Washington, D.C. He holds a B.E. (Mech.) from the University of Delhi, M. Tech (IE and OR) from the Indian Institute of Technology, Kharagpur, India and Ph.D. from Texas Tech University. He is the author of several papers appearing in such journals as: Operations Research, AIIE Transactions, Naval Research Logistics Quarterly, Decision Sciences, Operational Research Quarterly and The International Journal of Production Research. Serving on the editorial board of several professional journals, including Computers and Operations Research, Dr. Gupta is the co-author of an introductory text: Operations Research in Decision Making.