Skip to main content
. 2020 Dec 29;21(1):184. doi: 10.3390/s21010184
Algorithm 2: MTCLM_RANDOM (G, SU).
  • Input:

    graph G, SU

  • Output:

    X,CT.

  • 1:

    X={xij←0:∀i∈S,j∈JU};

  • 2:

    CT←∅;

  • 3:

    computer the optimal solution to the LP x*,y*;

  • 4:

    for eachi∈Sdo

  • 5:

      set max_round a positive constant.

  • 6:

      while max_round>0 do

  • 7:

       set xij=1 with probability xij*;

  • 8:

       if xkj=0∀k∈[1,i−1] then

  • 9:

        set xij=1;

  • 10:

        CT=CT⋃Uj

  • 11:

        break;

  • 12:

       else

  • 13:

        set xij=0

  • 14:

        max_round=max_round−1;

  • 15:

       end if

  • 16:

      end while

  • 17:

    end for

  • 18:

    returnX,CT;