Results 111 to 120 of about 11,422 (178)
Clustering solutions: a novel approach to solving NP-complete problems
, 2010 In this thesis, we introduce a novel approach to solving MAX-SAT problems. This algorithm clusters good solutions, and restarts the search from the closest feasible configuration to the centroid of each cluster.
Qasem, Mohamed
core
Tongxin xuebao, 2017 Comparing to the traditional data collecting method with data route,the technology of wireless mobile nodes has gradually became a new technique in the wireless sensor network.As the solution to the visiting order of the static nodes was an intrinsic NP ...
Hao FENG, Lei LUO, Yong WANG, Miao YE
doaj +2 more sources
On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment ...
Klerk, E. de +2 more
core
Traveling salesman path problems [PDF]
, 2005 Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005.Includes bibliographical references (p. 153-155).In the Traveling Salesman Path Problem, we are given a set of cities, traveling costs between city pairs and fixed source ...
Lam, Fumei, Fumei Lam
core
Approximation algorithms for the traveling salesman problem
, 2003 We first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable ...
Monnot, Jérôme +2 more
core +1 more source
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures
, 1994 A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems.
Mitra, G, Yarrow, L, Abdul-Hamid, F
core
A DISTRIBUTED APPROACH TO ANT COLONY OPTIMIZATION [PDF]
Swarm Intelligence(SI) is the emergent collective intelligence of groups of simple agents. Economy is an example of SI. Simulating an economy using Ant Colony algorithms would allow prediction and control of fluctuations in the complex emergent behavior ...
Eng. Sorin Ilie Ph. D Student +1 more
core
A general ant colony model to solve combinatorial optimization problems
Revista Colombiana de Computación, 2001 An Ants System is an artificial system based on the behavior of real ant colonies, which is used to solve combinatorial problems. Keywords: Combinatorial Optimization Problem,AntSystem, the Graph Partitioning and The Traveling Salesman Problems.
José Aguilar
doaj
Edge assembly combined with arc-based crossover for undirected traveling salesman with profits
Journal of King Saud University: Computer and Information SciencesIn the traveling salesman problem with profit, the orienteering problem (OP) and prize-collecting traveling salesman problem (PCTSP) are two typical TSPs with profits.
Jie Wang, Xueshi Dong
doaj +1 more source
Study of TSP based on self-organizing map
Journal of Measurement Science and Instrumentation, 2013 Self-organizing map（SOM） proposed by Kohonen has obtained certain achievements in solving the traveling salesman problem（TSP）.To improve Kohonen SOM,an effective initialization and parameter modification method is discussed to obtain a faster convergence
SONG Jin-juan +2 more
doaj