期刊名称：International Journal of Engineering and Computer Science
印刷版ISSN：2319-7242
出版年度：2013
卷号：2
期号：7
页码：2177-2185
出版社：IJECS
摘要：Many Combinatorial programming problems are NP-hard (Non Linear Polynomial), and we consider one of them called Ppathminimum distance connectivity from head quarter to the cities. Let there be n cities and the distance matrix D (i, j, k) isgiven from ith city to jth city using kth facility. There can be an individual factor which influences the distances/cost and thatfactor is represented as a facility k. We consider m
