Approver Selection Optimization for Access Management

We describe the problem of matching approvers to access requests in a dynamic environment at IBM. We cast the problem as a minimum-weight set-covering formulation and develop an integer-programming methodology to efficiently solve instances in a real-time environment. Our solution, which has been successfully deployed at IBM, uses state-of-the-art optimization tools from COIN-OR.

By: Walter C. Dietrich; John P. Fasano; Jon Lee

Published in: RC24309 in 2007


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .