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

This is the result of the experiment from the paper "The maximum weighted submatrix coverage problem: A CP approach". The original analysis was lost, and so the extraction of the result has been re-done. It should not differ from the original results. The interesting files are the following: - 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 {"name": "file of the matrix", "k": number of searched submatrices, "run": {"method": ["time", "objective value"]}}. CONTAINS ONLY RESULTS FOR THE SYNTH DATASET - best.json contains the best result obtained for each matrix. It is extracted from all.json.CONTAINS ONLY RESULTS FOR THE SYNTH DATASET - The other zips contains the results for the real dataset.