notions of duality as well as matroid and polyhedral theory. This paper reviews and categorizes decoding methods based on mathematical programming approaches for binary linear codes over binary-input ...

Abstract: 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. A general ...

This book serves as an introduction to graph ... on linear programming, which is used to provide an alternative analysis of the maximum flow problem. Two appendices containing prerequisite material on ...

Integer variables are variables that can only take whole numbers, such as 0, 1, 2, and so on. Binary variables are a special case of integer variables that can only take 0 or 1 values, often ...

Graph Edit Distance is an error-tolerant matching-based method that can be used to compute a dissimilarity measure between two graphs. Since it's such an important problem, many methods have been ...

This algorithm is designed in Python 3.7 based on the XOR model (Aref et al. 2019) for computing the exact value of frustration index (also called line index of balance). Binary linear programming ...