Aleksandr Kazachkov

icon indicating a website link https://akazachk.github.io

icon location Assistant Professor @ University of Florida ISE Dept, Research: Discrete Optimization • Computation Economics • Fair Mechanism Design

Results 4 comments of Aleksandr Kazachkov

Branch-and-bound node incorrectly pruned by infeasibility

On a possibly related note, I am curious about what Cbc reports as the objective value at branch-and-bound nodes (in the status messages): I notice that it can be rather...

Branch-and-bound node incorrectly pruned by infeasibility

I agree, numerics are an issue here. This is a presolved-by-Gurobi version of [bc1](http://miplib2017.zib.de/instance_details_bc1.html) from MIPLIB 2017, which is part of the "numerics" set. I will try the updated code...

Inconsistent results and long resolve times when resolving an instance with different objectives

@jjhforrest I think you are correct that the instance is nearly unbounded with the original objective. It seems I unintentionally cause the numerical issues. I actually intentionally set the objective...

Tracking nodes pruned by bound and by infeasibility

Thank you for clarifying, I had suspected that a ClpEventHandler would be a potential solution (I am indeed using OsiClp, I should have said that before), but I was hoping...