We introduce a series of new polynomially computable implicit operations on the class of all finite semigroups. These new operations enable us to construct a finite pro-identity basis for the pseudovariety (H) over ba...
详细信息
We introduce a series of new polynomially computable implicit operations on the class of all finite semigroups. These new operations enable us to construct a finite pro-identity basis for the pseudovariety (H) over bar of all finite semigroups whose subgroups belong to a given finitely based pseudovariety H of finite groups.
Wong,et al have studied the message routing problem to minimize the mean flow time of messages by allowing one of four parameters;origin node,destination node,release time and deadline;to be *** nonpreemptive transmis...
详细信息
Wong,et al have studied the message routing problem to minimize the mean flow time of messages by allowing one of four parameters;origin node,destination node,release time and deadline;to be *** nonpreemptive transmission,they showed that the problem is solvable in polynomialtime when destination node or deadline is allowed to be *** this paper,we continue to study the remaining two opened cases;*** origin node or release time is allowed to be *** show that it is NP-complete for each of these two cases.
The minimax linear assignment problem with additional linear constraints is studied. An exact polynomial time algorithm is developed, verified and validated in case of a single added constraint. In case of multiple co...
详细信息
The minimax linear assignment problem with additional linear constraints is studied. An exact polynomial time algorithm is developed, verified and validated in case of a single added constraint. In case of multiple constraints, the problem is more complex and becomes NP-hard. A tree search technique is proposed. Some computational studies are reported.
暂无评论