ANL-CEEESA/MIPLearn
1
0
Fork 0
mirror of https://github.com/ANL-CEEESA/MIPLearn.git synced 2025-12-06 01:18:52 -06:00
Code Issues Packages Projects Releases Wiki Activity

Add benchmark scripts

Browse Source
This commit is contained in:
Alinson S. Xavier
2020-02-01 08:21:47 -06:00
parent ccfcbe4e64
commit 7b44cd79e7
4 changed files with 213 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

BIN
docs/figures/mwss.png
View File

Binary file not shown.
Side by Side

Before

Width:  |  Height:  |  Size: 32 KiB

8
docs/problems.md
View File

@@ -49,7 +49,7 @@ MaxWeightStableSetGenerator(w=uniform(loc=100., scale=50.),
#### Challenge A
![alt](figures/mwss.png)
![alt](figures/benchmark_stab_a.png)
## Multidimensional 0-1 Knapsack Problem
@@ -95,6 +95,12 @@ If a probability distribution `w_jitter` is provided, then item weights will be
By default, all generated prices, weights and capacities are rounded to the nearest integer number. If `round=False` is provided, this rounding will be disabled.
### Benchmark results
#### Challenge A
![alt](figures/benchmark_knapsack_a.png)
!!! note "References"
* Freville, Arnaud, and Gérard Plateau. *An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem.* Discrete applied mathematics 49.1-3 (1994): 189-212.
* Fréville, Arnaud. *The multidimensional 0–1 knapsack problem: An overview.* European Journal of Operational Research 155.1 (2004): 1-21.