Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and...