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
Encrypted message transmission in a QO-STBC encoded MISO wireless Communication system under implementation of low complexity ML decoding algorithm
In this paper, we made a comprehensive BER simulation study of a quasi- orthogonal space time block encoded (QO-STBC) multiple-input single output(MISO) system. The communication system under investigation has incorporat...
PRIVACY PRESERVING CLUSTERING BASED ON SINGULAR VALUE DECOMPOSITION AND GEOMETRIC DATA PERTURBATION
Privacy preservation is a major concern when the application of data mining techniques to large repositories of data consists of personal, sensitive and confidential information. Singular Value Decomposition (SVD) is a m...
Using Relational Database Model in Cloud Computing
The advent of digital systems for the production and transmission of information decisively influences human progress and represents the future in any field of social life. In order to survive, organizations must correla...
A Study of Physiological Signals-based Emotion Recognition Systems
The use of physiological signals is relatively recent development in human emotion recognition. Interest in this field has been motivated by the unbiased nature of such signals, which are generated autonomously from the...
Overview of OLAP cubes, importance, build Considerations and querying with MDX.
An OLAP cube is a method of storing data in a multidimensional form, generally for reporting purposes. The purpose of an OLAP cube is to store data in such a way that an end user can slice and dice through the data and t...