Abstract
The Traveling Salesman Problems (TSP) has been a very important topic of study for operations researchers and mathematicians for decades. Computer hardware and software advances in recent years have provided multiple alternative approaches to this classic combinatorial challenge. The objective of this paper is to present an approach to the Traveling Salesman Problems using Microsoft Excel Solver and Premium Solver Platform. The paper illustrates a solution approach which efficiently solves small-size Traveling Salesman Problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
