Letter to the Editor—On the Merit of the Generalized Origin and Restarts in Implicit Enumeration

This note discusses the concept of starting a (zero-one) tree search at an integer solution obtained from the associated linear program and restarting it at improved feasible solutions. Computational experience indicates that the length of the enumeration is inversely proportional to the closeness of the origin to the minimal integer vector.