Abstract / Description of output
The problem of finding the optimal timing of audit activities within an organisation has been addressed by many researchers. We propose a stochastic programming formulation with Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) certainty-equivalent models. In experiments neither approach dominates the other. However, the CP approach is orders of magnitude faster for large audit times, and almost as fast as the MILP approach for small audit times.
Original language | English |
---|---|
Pages (from-to) | 325-346 |
Number of pages | 22 |
Journal | Journal of Combinatorial Optimization |
Volume | 19 |
Issue number | 3 |
Early online date | 21 Jan 2009 |
DOIs | |
Publication status | Published - 1 Apr 2010 |
Keywords / Materials (for Non-textual outputs)
- uncertainty
- audit scheduling
- combinatorial optimization
- mathematical programming
- constraint programming