C&OR 2018

These results refer to the paper "Weighted Fair Sequences Problem", published in the journal Computers and Operations Research in 2018.

Our experiments were designed to assess the performance of the proposed MILP model, the impact of some cuts added to the model, the iterative solution method, and the performance limits of such solutions. The format of the result files can be divided into two groups:

Group 1 (WFSP model, WFSP model + Cut 1, WFSP model + Cut 2, WFSP model + Cut 3, WFSP model + Cut 4, WFSP model + all the cuts)

<n>

<TMAX>

<Sum of the maximum number of copies of each symbol >

<Objective value>

<Execution time>

<Gap>

<Best Bound>

Group 2 (Iterative Solution Method)

<n>

<TMAX>

<Sum of the maximum number of copies of each symbol >

<Lower bound obtained from a MILP model>

<Objective value>

<Time spent on computing the lower bound>

<Time spent on solving the MNC model>

<Total time>

<Number of times that the WFSP formulation was solved in the iterative method>

<Gap>

<Best Bound>

The result files can be downloaded below:

WFSP.zip (WFSP model)

WFSP_c1.zip (WFSP model + Cut 1)

WFSP_c2.zip (WFSP model + Cut 2 )

WFSP_c3.zip (WFSP model + Cut 3)

WFSP_c4.zip (WFSP model + Cut 4)

WFSP_C_plus_c2.zip (WFSP model + all the cuts)

SM.zip (Iterative Solution Method)

WFSP_C.zip (WFSP model + cuts 1, 2, and 3)

SM_li.zip (Iterative Solution Method on large instances)

WFSP_C_li.zip (WFSP model + cuts 1, 2, and 3 on large instances)