Browsing by Keywords "Traveling salesman problem"
Now showing items 1-4 of 4
-
Cache locality exploiting methods and models for sparse matrix-vector multiplication
(Bilkent University, 2009)The sparse matrix-vector multiplication (SpMxV) is an important kernel operation widely used in linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers to solve a system of ... -
Exact algorithms for a task assignment problem
(World Scientific Publishing Company, 2009)We consider the following task assignment problem. Communicating tasks are to be assigned to heterogeneous processors interconnected with a heterogeneous network. The objective is to minimize the total sum of the execution ... -
Multi-population parallel genetic algorithm using a new genetic representation for the euclidean traveling salesman problem
(İstanbul Technical University, 2005)This paper introduces a multi-population genetic algorithm (M-PPGA) using a new genetic representation, the kth-nearest neighbor representation, for Euclidean Traveling Salesman Problems. The proposed M-PPGA runs M greedy ... -
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
(Elsevier, 2010)Given an undirected network with positive edge costs and a natural number p, the hop-constrained minimum spanning tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path ...
