"The maximum weighted submatrix coverage problem: A CP approach": experiment results

<p>This is the result of the experiment from the paper&nbsp;&quot;The maximum weighted submatrix coverage problem: A CP approach&quot;.</p> <p>The original analysis was lost, and so the extraction of the result has been re-done. It should not differ from the original results.</p> <p>&nbsp;</p> <p>The interesting files are the following:</p> <p>- all.json contains a JSON list. Each element of the list contains the result of running all the methods on a specific matrix. Each entry is in the form {&quot;name&quot;: &quot;file of the matrix&quot;, &quot;k&quot;: number of searched submatrices, &quot;run&quot;: {&quot;method&quot;: [&quot;time&quot;, &quot;objective value&quot;]}}. CONTAINS ONLY RESULTS FOR THE SYNTH DATASET</p> <p>- best.json contains the best result obtained for each matrix. It is extracted from all.json.CONTAINS ONLY RESULTS FOR THE SYNTH DATASET</p> <p>- The other zips contains the results for the real dataset.</p>