Software Open Access Maximal-Sum Submatrix search using a hybrid Contraint Programming/Linear Programming approach: experiment code and results

Guillaume Derval; Pierre Schaus

doi:10.5281/zenodo.3992324

Published August 19, 2020 | Version 1.0

Dataset Open

Software Open Access Maximal-Sum Submatrix search using a hybrid Contraint Programming/Linear Programming approach: experiment code and results

1. UCLouvain

Experiments (made with Snakemake) code & results for the paper " Software Open Access Maximal-Sum Submatrix search using a hybrid Contraint Programming/Linear Programming approach" under review at EJOR.

Files

Files (1.6 GB)

Name	Size
data.tar.xz md5:7f649bf642845c840a86770cbf2911f4	1.5 GB	Download
results.tar.xz md5:5af8a4cdeed3b752c59e62b472c61fb7	86.8 MB	Download
source.tar.gz md5:04f43bec05ab1d7ffc156267c9c4e189	36.9 MB	Download

156

Views

Downloads

Show more details

	All versions	This version
Views	156	156
Downloads	61	61
Data volume	40.7 GB	40.7 GB

More info on how stats are collected....

DOI

Resource type

Dataset

Publisher

Zenodo

License: Creative Commons Attribution 4.0 International

The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited. Read more

Technical metadata

Created: August 19, 2020
Modified: March 8, 2021

Software Open Access Maximal-Sum Submatrix search using a hybrid Contraint Programming/Linear Programming approach: experiment code and results

Authors/Creators

Description

Files

Files (1.6 GB)