Given a set S of n points in the unit square [0, 1], an optimal traveling salesman tour of S is a tour of S that is of minimum length. A worst-case point set for the Traveling Salesman Problem in the unit square is a point set S whose optimal traveling salesman tour achieves the maximum possible length among all point sets S ⊂ [0, 1], where |S| = n. An open problem is to determine the structure...

Trip planning is both challenging and tedious for tourists due to their unique interest preferences and various trip constraints. Despite the availability of online resources for tour planning and services provided by tour agencies, there are various challenges such as: (i) selecting POIs that are personalized to the unique interests of individual travellers; (ii) constructing these POIs as an ...

This paper makes the detailed analyses of computational complexities and related parameters selection on our proposed constrained learning neural network root-finders including the original feedforward neural network root-finder (FNN-RF) and the recursive partitioning feedforward neural network root-finder (RP-FNN-RF). Specifically, we investigate the case study of the CLA used in neural root-f...

Sri Lanka being a popular tourist destination entertains a large number of tourists each year. Tourists are issued a printed guide booklet to find out interesting places during the visit. Due to the lack of up to date information and navigation support, tourists are not able to visit all the attractions during a visit. Our researched was based on discovering a solution to improve this situation...

The spatial organization of the genome plays a crucial role in the regulation of gene expression. Recent experimental techniques like Hi-C have emphasized the segmentation of genomes into interaction compartments that constitute conserved functional domains participating in the maintenance of a proper cell identity. Here, we propose a novel method, IC-Finder, to identify interaction compartment...

We provide O(1) approximation algorithms for the following NP-hard problem called k-Delivery TSP : We have at our disposal a truck of capacity k, and there are n depots and n customers at various locations in some metric space, and exactly one item (all of which are identical) at each depot. We want to nd an optimal tour using the truck to deliver one item to each customer. Our algorithms run i...