On-line algorithms have been extensively studied for the onedimensional bin packing problem. Semi-online property relax the online prescription in such a way that it allows some extra operations or the algorithm knows more (e.g. the optimum value) in advance. In this paper we present an improved lower bound for the asymptotic competitive ratio of any on-line bin packing algorithm which knows th...

Abstract Monofilament type of polyaromatic amide (PA) and carbon nanotube (CNT) composite fibers is presented. A concept a lyotropic liquid crystal (LLC) constructed via spontaneous self-assembly introduced to mitigate the extremely low compatibility between PA CNT. These approaches provide an effective co-processing route CNT simultaneously fabricate uniform, continuous, reliable through wet-s...

We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form of two new greedy manipulation algorithms based on intuitions from the bin-packing and multiprocessor scheduling domains. Although we have not been able to show that these algorithms beat existing methods in the worst-c...

We consider the bin-packing problem with the constraint that the elements are in the plane, and only elements within an oriented unit square can be placed within a single bin. The elements are of given weights, and the bins have unit capacities. The problem is to minimize the number of bins used. Since the problem is obviously NP-hard, no algorithm is likely to solve the problem optimally in be...

We consider the one-dimensional skiving stock problem which is also known as the dual bin packing problem: find the maximum number of items with minimum length L that can be constructed by connecting a given supply of m ∈ N smaller item lengths l1, . . . , lm with availabilities b1, . . . , bm. For this optimization problem, we investigate the quality of the continuous relaxation by considering...

Patients in a forensic psychiatric facility often require escorted transport to medical facilities for investigations or treatments of physical health ailments. Transporting these patients presents significant safety and custody challenges because of the nature of patients housed in forensic psychiatric facilities. A significant proportion of these patients may be transfers from the Department ...

A new measure, the accommodating function, for the quality of on-line algorithms is presented. The accommodating function, which is a generalization of both the competitive ratio and the accommodating ratio, measures the quality of an on-line algorithm as a function of the resources that would be suucient for some algorithm to fully grant all requests. More precisely, if we have some amount of ...

We study the on-line bin packing problem (BPP). In BPP, we are given a sequence B of items a1, a2, . . . , an and a sequence of their sizes (s1, s2, . . . , sn) (each size si ∈ (0, 1]) and are required to pack the items into a minimum number of unit-capacity bins. Let R∞ {α,β} be the minimal asymptotic competitive ratio of an on-line algorithm in the case when all items are only of two differen...

This paper presents the use of genetic algorithms (GA) for solving the dual bin packing problem using fuzzy objectives. In bin packing problems, a list, L of items is to be packed into a minimum number of bins. In dual bin packing the items are packed into a maximum number of bins, assuring a minimum weight for each bin. We consider a class which we call dynamic dual bin packingg. Similar to th...

This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the number of wavelengths used. This problem has been shown to be NP-complete and several heuristic algorithms have been developed to solve it. We suggest very efficient, yet simple, heuristic algorithms for the RWA problem ...