Thetripletproblemisformalizedasbelow: min

The overall algorithm is displayed in Algorithm 2. We denote (j) as the optimal value of the inner minimization problem with respect toj, and denote (j) as its lower bound. Specifically, the size of the neighborhood whererandnear+ and randnear sample random instances is 10.