A Graph Theoretic Equivalence for Integer Programs.

摘要

The paper is concerned with the relationship between 0-1integer programs and graphs. An equivalence is established between solving 0-1integer programs with quadratic or linear objective function and linear constraints and finding minimum cut sets in graphs with both positive and negative are numbers. (Author)