Integer Programming Cláudio N. Meneses Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, Florida, 32611, USA, [email protected] Zhaosong Lu School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205, USA, [email protected] Carlos A.S. Oliveira, Panos M. Pardalos Department of Industrial and S...

The closest pair problem (CPP) is one of the well studied and fundamental problems in computing. Given a set of points in a metric space, the problem is to identify the pair of closest points. Another closely related problem is the fixed radius nearest neighbors problem (FRNNP). Given a set of points and a radius R, the problem is, for every input point p, to identify all the other input points...

Today freight transport covers great importance in the field of the transportation system and in general in the economic system. It represents one of the most important elements in the national economy development process. In spite of the importance of freight transport, only in the last ten years the research devotes itself to this field. The most investigate topics are the national freight tr...

The following two computational problems are studied: Duplicate grouping: Assume that n items are given, each of which is labeled by an integer key from the set {0, . . . , U − 1}. Store the items in an array of size n such that items with the same key occupy a contiguous segment of the array. Closest pair: Assume that a multiset of n points in the d-dimensional Euclidean space is given, where ...

Twin Support Vector Machines (TWSVM) are developed on the basis of Proximal Support Vector Machines (PSVM) and Proximal Support Vector Machine based on the generalized eigenvalues(GEPSVM). The solving of binary classification problem is converted to the solving of two smaller quadratic programming problems by TWSVM. And then it gets two non-parallel hyperplanes. Its efficiency of dealing with t...

Given a (master) set M of n points in d-dimensional Euclidean space, consider drawing a random subset that includes each point mi ∈ M with an independent probability pi. How difficult is it to compute elementary statistics about the closest pair of points in such a subset? For instance, what is the probability that the distance between the closest pair of points in the random subset is no more ...

The problem of closest pair is a basic problem of computational geometry. This problem was studied while considering the privacy and a protocol was proposed to solve it only considering the level of coordinate axis. The protocol ranked the numbers of two parties firstly. After that each party got the orders of his own numbers. Then the two participants used the protocol of private comparison pr...

Article history: Received 18 May 2010 Received in revised form 11 January 2011 Accepted 21 January 2011 Available online 28 January 2011

Œis study investigates whether reoptimization can help in solving the closest substring problem. We are dealing with the following reoptimization scenario. Suppose, we have an optimal llength closest substring of a given set of sequences S. How can this information be bene€cial in obtaining an (l + k)-length closest substring for S? In this study, we show that the problem is still computational...