GLM Versus Continuous Approximation for Convex Integer Programs

Greenberg, Harvey J. (1974) GLM Versus Continuous Approximation for Convex Integer Programs. Technical Report CS74022-R, Computer Science, Virginia Tech.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
CS74022-R.pdf (206531)

Abstract

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.

Item Type:	Departmental Technical Report
Keywords:	Optimization, Lagrange Multipliers, Integer Programming, Convex Programming
Subjects:	Computer Science > Historical Collection(Till Dec 2001)
ID Code:	775
Deposited By:	Administrator, Eprints
Deposited On:	18 April 2006