Facing supply uncertainty of bulky wastes, the capacitated multi-product stochastic network design model for bulky waste recycling is proposed in this paper. The objective of this model is to minimize the first-stage total fixed costs and the expected value of the second-stage variable costs. The possibility of operation costs and transportation costs for bulky waste recycling is considered ...

Spatio-temporal patterns extracted from historical trajectories of moving objects reveal important knowledge about movement behavior for high quality LBS services. Existing approaches transform trajectories into sequences of location symbols and derive frequent subsequences by applying conventional sequential pattern mining algorithms. However, spatio-temporal correlations may be lost due to th...

This paper presents the optimal compression for sequences with undefined values. Let we have (N −m) undefined and m defined positions in the boolean sequence −→ V of length N . The sequence code length can’t be less then m in general case, otherwise at least two sequences will have the same code. We present the coding algorithm which generates codes of almost m length, i.e. almost equal to the ...

Given two genomic maps G1 and G2 each represented as a sequence of n gene markers, the maximal strip recovery (MSR) problem is to retain the maximum number of markers in both G1 and G2 such that the resultant subsequences, denoted as G ∗ 1 and G ∗ 2, can be partitioned into the same set of maximal strips, which are common substrings of length greater than or equal to two. The complementary maxi...

This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is de...

We give the first examples of non-trivially positively-useless predicates subject only to P 6= NP. In particular, for every constraint function Q : {−1, 1}4 → R, we construct Contraint-SatisfactionProblem (CSP) instances without negations which have value at least 1 − ε when evaluted for the arity-four odd-parity predicate, yet it is NP-hard to find a solution with value significantly better th...