IMPLICIT ENUMERATION USING AN IMBEDDED LINEAR PROGRAM
Arthur M. Geoffrion · Princeton University Press eBooks · 2015
Abstract : Integer programming by implicit enumeration has been the subject of several recent investigations. Computational efficiency seems to depend primarily on the ability of various tests, applied to the constraints in connection with 'partial solutions,' to exclude from further consideration a sufficiently large proportion of the possible solutions. Most of the simpler or more appealing of these tests can be applied at reasonable computational cost essentially to only one constraint at a time. Two main approaches have been suggested for mitigating this limitation.