Abstract
This article presents an integer programming approach to a practical problem faced by analysts in the Department for Work and Pensions working with Housing Benefit (HB) data. It shows how, using a simple modification of the set covering problem, the time required to retrieve HB data from the data server can be significantly decreased. Computational comparisons with two alternative, suboptimal approaches are also presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas E and Padberg M (1976). Set partitioning—a survey. SIAM Rev 18: 710–760.
Christofides N and Korman S (1975). A computational survey of methods for the set covering problem. Mngt Sci 21: 591–599.
SAS Institute Inc. (1999). SAS/OR User's Guide: Mathematical Programming. SAS Institute Inc.: Cary, NC, USA.
Wolsey LA (1998). Integer Programming. Wiley-Interscience Publications: New York.
Acknowledgements
Any views expressed in this article are the authors' and do not necessarily represent official policy.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rappos, E., Thompson, E. An integer programming approach to optimize Housing Benefit data retrieval. J Oper Res Soc 59, 182–185 (2008). https://doi.org/10.1057/palgrave.jors.2602558
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2602558