Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
When a paid price discount activity occurs, the decisionmaker must decide whether or not and when to pay the additional fees for preferential price in an online fashion. This prob...
We address a large scale waste collection vehicle routing problem with time windows (VRPTW) complicated by multiple disposal trips and drivers lunch breaks. A fitness search spac...
Andrew Runka, Beatrice M. Ombuki-Berman, Mario Ven...
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...