Traveling Salesman Problem: A Case Study
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2012, Vol 3, Issue 1
Abstract
In this paper assignment based integer linear formulation presented for solving traveling salesman problem. Unfortunately, the assignment model can lead to infeasible solutions. Infeasibility removes by introducing additional constraints. Then this linear problem solved by open source software.
Authors and Affiliations
Dr. Leena jain, Mr. Amit Bhanot
OPTIMIZATION OF CHANNEL ALLOCATION ALGORITHM FOR HOT SPOT CELLS IN WIRELESS NETWORKS
Dense deployment of cellular networks is leading to scarcity of communication bandwidth or what we call as channel. If compared to its wired counterparts, wireless cellular network have limited number of channels availab...
An Improved Min-Min Task Scheduling Algorithm with Grid Utilization and Minimized Makespan
Grid computing is hardware and software infrastructure which offers a economical, distributable, coordinated and credible access to strong computational abilities [1]. For optimal use of the abilities of large distribute...
Semantic link-based Model for User Recommendation in Online community
Recommendation systems have been widely used to overcome the problem of information overloading and help people to make the right decision of needed items, such as: movies, books, products, or even people. This paper pro...
AUTOMATIC ROAD DETECTION OF SATELLITE IMAGES USING IMPROVED EDGE DETECTION
Road networks play an important role in a number of geospatial applications, such as cartographic, infrastructure planning and traffic routing software. Automatic and semi-automatic road network extraction techniques hav...
Suggested Marketing Strategy Using Apriori and FP-Growth Algorithms in retail sales in Egypt
Due to the increase of retail sales in Egypt and all over the world, came the importance for the managers of supermarkets to develop marketing strategy to maximize their profits, by getting rid of inactive products. Prod...