Parsimonious Binary-Encoding in Integer Programming Published: 2005/05/10 Don CoppersmithJon LeeCategories 0-1 Programming, Polyhedra Tags all different, coloring, integer programming, polytope Short URL: https://optimization-online.org/?p=9745 We describe an effective method for doing binary-encoded modeling, in the context of 0/1 linear programming, when the number of feasible configurations is not a power of two. Our motivation comes from modeling all-different restrictions. ArticleDownload View PDF