The layered workflow process model provide a modeling approach and analysis for the key process with Petri Net. It not only describes the relation between the process of business flow and transition nodes clearly, but also limits the rapid increase in the scale of libraries, transition and directed arcs. This paper studies the process like reservation and complaint handling information manageme...

Bounds for the optimal tour length for a hypothetical TSP algorithm are derived. The present is an exemplification of part of [4], and contains some points made in [3] in reference to the TSP. Consider the hypothetical (and restricted) problem: Given (E, d), construct such S ⊆ E, such that (i) 1 ≤ ‖S‖ ‖S0‖ ≤ ξ; (ii) S is of structure as that of S0; and (iii) |S| = |S0|, where ‖S0‖ is an extrema...

In this paper we introduce an extension of the well known Rural Postman Problem, which combines arc routing with profits and facility location. Profitable arcs must be selected and facilities must be located at both end-points of the selected arcs, and a tour must be identified that maximizes the difference between the profit collected along the arcs and the cost of traversing the arcs and inst...

Algebraic high level nets have been introduced in order to exploit the rich theory of algebraic speci cations for high level Petri nets Besides the use of algebraic speci cations most formalizations of algebraic nets have one feature in common the number of tokens owing through a particular arc when the corresponding transition occurs is always the same in whichever mode the transition occurs W...

Finding the origin of short phrases propagating through the web has been formalized by Leskovec et al. [ACM SIGKDD 2009] as DAG PARTITIONING: given an arc-weighted directed acyclic graph on n vertices and m arcs, delete arcs with total weight at most k such that each resulting weakly-connected component contains exactly one sink—a vertex without outgoing arcs. DAG PARTITIONING is NP-hard. We sh...

Given a set of n nonnegative weighted circular-arcs on a unit circle, and an integer k, the k Best Cuts for Circular-Arcs problem, abbreviated as k-BCCA problem, is to nd a placement of k points, called cuts, on the circle such that the total weight of the arcs that contain at least one cut is maximized. We rst solve a simpler version using dynamic programming, the k Best Cuts for Intervals (k-...