GLM Versus Continuous Approximation for Convex Integer Programs
Greenberg, Harvey J.
MetadataShow full item record
GLM is compared to continuous approximation for convex, integer programs. After noting the stronger bound provided by GLM, Lagrangian duality and a gap closing heuristic is used to demonstrate how GLM may provide a better feasible policy as well.