We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...