A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
This article introduces the concept of monotonic transactions. A monotonic transaction is a particular case of transactions for which the load arrival pattern is (or can be by rot...
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...