In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
Yingtao Ren, Maged M. Dessouky, Fernando Ord&oacut...
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
A plan with rich control structures like branches and loops can usually serve as a general solution that solves multiple planning instances in a domain. However, the correctness o...