Therefore, we can use it for a bottom-up (max-violating) inference procedure, which first finds the best candidate item to be put at the lowest position of the rank and proceeds filling the positions in the ascending order.
we start with the last N th position of the rank and put there the minimum weighted item: According to the decomposition in Eq.