An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...

In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...

We present an algorithm that accelerates the extraction of iso-surfaces from unstructured grids by avoiding the traversal of the entire set of cells in the volume. The algorithm consists of a sweep algorithm and a data decomposition scheme. The sweep algorithm in-crementally locates intersected elements, and the data decomposition scheme restricts the algorithm's worst-case performance. For dat...

We investigate cumulative scheduling in uncertain environments, using constraint programming. We detail in this paper the dynamic sweep filtering algorithm of the FlexC global constraint.

A rigid interval graph is an interval graph which has only one clique tree. In 2009, Panda and Das show that all connected unit interval graphs are rigid interval graphs. Generalizing the two classic graph search algorithms, Lexicographic Breadth-First Search (LBFS) and Maximum Cardinality Search (MCS), Corneil and Krueger propose in 2008 the so-called Maximal Neighborhood Search (MNS) and show...

The greedy triangulation of a nite planar point set is obtained by repeatedly inserting a shortest diagonal that doesn't intersect those already in the plane. We show that the problem of constructing the greedy triangulation of a nite set of points with integer coordinates in the plane is P-complete. This is the rst known geometric P-complete problem where the input is given as a set of points....

In their 2009 paper, Corneil et al. design a linear time interval graph recognition algorithm based on six sweeps of Lexicographic Breadth-First Search (LBFS) and prove its correctness. They believe that their corresponding 5-sweep LBFS interval graph recognition algorithm is also correct. Thanks to the LBFS structure theory established mainly by Corneil et al., we are able to present a 4-sweep...

The objective of a sweep coverage problem is to find the minimum number of mobile sensors to ensure the periodic monitoring for a given set of points of interest. In this paper we have remarked on the flaw of approximation algorithms proposed in the paper [1] for sweep coverage with mobile sensors and proposed a 3-approximation algorithm to guarantee sweep coverage with mobile and static sensors.

Two novel applications of the plane sweep paradigm are demonstrated, namely, for the computation of extended viewsheds on gridded DEMs and for class interval selection on TIN-based DEMs. In both cases, the e ciency of the plane sweep algorithm is signi cantly better than a straightforward approach. The algorithms are presented by rst giving the plane sweep method as a general approach that requ...

This paper presents a new way to compute the Delaunay triangulation of a planar set P of n points, using sweep-circle technique combined with the standard recursive edge-flipping. The algorithm sweeps the plane by an increasing circle whose center is a fixed point in the convex hull of P . Empirical results and comparisons show that it reduces the number of in-circle tests and edge-flips, and i...