Algorithm 1.
1 | Solve the Relaxed Integer Programming (RIP) problem; | |
2 | Compute the entropy ex of the solution xRIP from RIP; | |
3 | if | ex ≤ e* then |
/* e* is a threshold (0 ≤ e* ≤ 1) */ | ||
4 | x ← xRIP; | |
5 | else | |
6 | Replace the constraint of 0 ≤ xj ≤ 1 with xj ∈ {0,1}; | |
7 | Solve the corresponding Integer Programming (IP) problem for xIP with the updated constraint xj ∈ {0,1}; | |
8 | x ← xIP; | |
9 | end | |
10 | return x; |