The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
We present a method to systematically detect feature interactions in requirements, which are expressed as constraints on system event traces. We show its application on the lift sy...