Answers are grounded in this paper and cite their sources.
This note shows that if an integer linear program in n variables has more than 2 n linear inequality constraints, then either some of the constraints are unnecessary or there is at least one feasible integer point.
No takes yet. Share an insight, caveat, or question.
David E. Bell (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: