For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
Abstract—Service composition schemes create high-level application services by combining several basic services. Service composition schemes for dynamic, open systems, such as th...
We present two heuristics based on constraint technology that solve the problem of generating air traffic management contingency plans, which are used in the case of a catastrophic...
Karl Sundequist Blomdahl, Pierre Flener, Justin Pe...
Abstract. Scheduling staff shift work in a hospital ward is a well-known problem in the operation research field but, as such, it is very often studied from the algorithmic point o...
Carmelo Ardito, Paolo Buono, Maria Francesca Costa...