The development of an efficient and practical method to recognize matrices originating from generalized graphs, in the same way that network matrices are defined over directed graphs, remains an open question. In this paper we present such a recognition procedure for binet matrices which are known to characterize an important class of integral polyhedra. A mathematical programming formulation for the recognition problem is provided, where the special structure of these matrices is expressed via a set of constraints. Finally, given that binet matrices represent certain classes of matroids, we present a set of areas ranging from combinatorial optimization to matroid theory that can benefit from our approach.

开发一种有效且实用的方法来识别源自广义图的矩阵，就像在有向图上定义网络矩阵一样，仍然是一个悬而未决的问题。在本文中，我们提出了这样一种双奈矩阵的识别过程，已知该双奈矩阵可以表征一类重要的积分多面体。提供了识别问题的数学规划公式，其中这些矩阵的特殊结构通过一组约束来表达。最后，鉴于比奈矩阵代表某些类别的拟阵，我们提出了一系列从组合优化到拟阵理论的领域，这些领域可以从我们的方法中受益。