We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients to them within capacity restrictions in order to minimize the maximum distance between a client and the facility to which it is assigned (capacitated p-center). The algorithm iteratively sets a maximum distance value within which it tries to assign all clients, and thus solves bin-pa...

This paper introduces a new maximum fault-tolerance barrier-coverage problem in hybrid sensor network, which consists of a number of both static ground sensors and fully-controllable mobile sensors. The problem aims to relocate the mobile sensor nodes so that the fault-tolerance of the barriercoverage of the hybrid sensor network is maximized. The main contribution of this paper is the polynomi...

An Enhancement to the exact algorithm of Daskin (1995) to solve the vertex P center problem is proposed. A simple enhancement which uses tighter initial lower and upper bounds, and a more appropriate binary search method are introduced to reduce the number of subproblems to be solved. These ideas are tested on a well known set of problems from the literature (i.e., TSP-Lib problems) with encour...

We propose to model recurring events as multipoint events by extending Vilain and Kautz’s point algebra [7]. We then propose an exact algorithm based on van Beek’s exact algorithm) forfinding feasi 6 le relations for multi-point event networks. The complexity of our method is compared with previously known results both for recurring and non-recurring events. We identify the special cases for wh...

This paper is concerned with a variation of the multiple knapsack problem (MKP) [5, 6], where we are given a set of n items N = {1, 2, . . . , n} to be packed into m possible knapsacks M = {1, 2, . . . ,m}. As in ordinary MKP, by w j and p j we denote the weight and profit of item j ∈ N respectively, and the capacity of knapsack i ∈ M is ci. However, a fixed cost fi is imposed if we use knapsac...

Previously, the authors of this work have presented in a series of papers polynomial-space algorithms for the TSP in graphs with degree at most five, six and seven. Each of these algorithms is the first algorithm specialized for the TSP in graphs of limited degree five, six, and seven respectively, and the running time bound of these algorithms outperforms Gurevich and Shelah’s O∗(4nnlogn) algo...

In this paper we deal with the general problem of recombining the information from evolutionary trees representing the relationships between distinct gene families. First we solve a problem from [8] regarding the construction of a minimum reconciled tree by giving an efficient algorithm. Then we show that the exemplar problem, arising from the exemplar analysis of multigene genomes [2], is NP-h...

We present an O∗(1.3160n)-time algorithm for the edge dominating set problem in an n-vertex graph, which improves previous exact algorithms for this problem. The algorithm is analyzed by using the “Measure and Conquer method.” We design new branching rules based on conceptually simple local structures, called “clique-producing vertices/cycles,” which significantly simplify the algorithm and its...

the first integral method is an efficient method for obtaining exact solutions of some nonlinear partial differential equations. this method can be applied to non integrable equations as well as to integrable ones. in this paper, the first integral method is used to construct exact solutions of the 2d ginzburg-landau equation.