A Graph-Theoretic Equivalence for Integer Programs
Jean-Claude Picard, H. Donald Ratliff
Operations Research · 1973 · Volume 21 · Issue 1
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.
Enable JavaScript for citation tools and additional paper interactions.