Greenberg, Harvey J.2013-06-192013-06-191974http://hdl.handle.net/10919/20256GLM 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.application/pdfenIn CopyrightTechnical reportCS74022-Rhttp://eprints.cs.vt.edu/archive/00000775/01/CS74022-R.pdf