We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one ...
In this paper, we propose a robust and efficient algorithm for generalized orthonormal discriminant vectors (GODV). The major advantage of the proposed method is the use of the ra...
This paper presents a novel and interesting combination of wavelet techniques and eigenfaces to extract features for face recognition. Eigenfaces reduce the dimensions of face vec...
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...