A Graph-Theoretic Equivalence for Integer Programs

Abstract
This paper is concerned with the relation between 0-1 integer programs and graphs. An equivalence is established between solving 0-1 integer programs with quadratic or linear objective functions and solving a cut problem on a related graph.