<html><head><meta http-equiv="Content-Type" content="text/html; charset=us-ascii"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div style="margin: 0px; font-stretch: normal; font-size: 13px; line-height: normal; font-family: "Helvetica Neue";" class="">Dear SCIP community,</div><div style="margin: 0px; font-stretch: normal; font-size: 13px; line-height: normal; font-family: "Helvetica Neue";" class="">can you tell me if it is possible to run SCIP in such a way, when only cuts (at root node) will be used and no branching?</div><div style="margin: 0px; font-stretch: normal; font-size: 13px; line-height: normal; font-family: "Helvetica Neue";" class="">We use SCIP in "a console mode" as a standalone application.</div><div style="margin: 0px; font-stretch: normal; font-size: 13px; line-height: normal; font-family: "Helvetica Neue"; min-height: 15px;" class=""><br class=""></div><div style="margin: 0px; font-stretch: normal; font-size: 13px; line-height: normal; font-family: "Helvetica Neue";" class="">My question is triggered by an effect my colleague found: one of commercial solvers solves some of Integer Linear Programming problems much faster by cuts only, without any branching. It was a kind of Constrained Programming problem, to find a feasible solution of a system of linear equations with binary variables.</div><div style="margin: 0px; font-stretch: normal; font-size: 13px; line-height: normal; font-family: "Helvetica Neue";" class="">"Only cuts" took a few seconds and "cuts and branching" - a few minutes.</div><div class=""><br class=""></div><div class="">Regards,</div><div class="">Sergey</div><div class=""><br class=""></div></body></html>