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

Better encapsulate solvers

Browse Source
This commit is contained in:
Alinson S. Xavier
2020-02-22 20:22:33 -06:00
parent 141c8f0fdf
commit f8e8aeb973
3 changed files with 109 additions and 86 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
miplearn/benchmark.py
View File

@@ -61,25 +61,17 @@ class BenchmarkRunner:
"Nodes",
"Mode",
])
wallclock_time = None
for key in ["Time", "Wall time", "Wallclock time"]:
if key not in result["Solver"][0].keys():
continue
if str(result["Solver"][0][key]) == "<undefined>":
continue
wallclock_time = float(result["Solver"][0][key])
nodes = result["Solver"][0]["Nodes"]
lb = result["Problem"][0]["Lower bound"]
ub = result["Problem"][0]["Upper bound"]
lb = result["Lower bound"]
ub = result["Upper bound"]
gap = (ub - lb) / lb
self.results = self.results.append({
"Solver": name,
"Instance": instance,
"Wallclock Time": wallclock_time,
"Wallclock Time": result["Wallclock time"],
"Lower Bound": lb,
"Upper Bound": ub,
"Gap": gap,
"Nodes": nodes,
"Nodes": result["Nodes"],
"Mode": solver.mode,
}, ignore_index=True)
groups = self.results.groupby("Instance")