1\topcaption{\label{tab:options} 2List of options and compatibility with the different algorithms. 3} 4\tablehead{\hline 5Option & type & {\tt B-BB} & {\tt B-OA} & {\tt B-QG} & {\tt B-Hyb} & {\tt B-Ecp} & {\tt B-iFP} & {\tt Cbc\_Par} \\ 6\hline 7\hline} 8\tabletail{\hline \multicolumn{9}{|c|}{continued on next page}\\\hline} 9\tablelasttail{\hline} 10{\footnotesize 11\begin{xtabular}{@{}|@{\;}l@{\;}|@{\;}r@{\;}|@{\;}c@{\;}|@{\;}c@{\;}|@{\;}c@{\;}|@{\;}c@{\;}|@{\;}c@{\;}|@{\;}c@{\;}|@{\;}c@{\;}|@{}} 12\hline 13\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{Algorithm choice}\\ 14\hline 15algorithm& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 16\hline 17\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{Branch-and-bound options}\\ 18\hline 19allowable\_fraction\_gap& F& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 20allowable\_gap& F& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 21cutoff& F& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 22cutoff\_decr& F& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 23enable\_dynamic\_nlp& S& $\surd$& -& -& -& -& -& -\\ 24integer\_tolerance& F& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 25iteration\_limit& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 26nlp\_failure\_behavior& S& $\surd$& -& -& -& -& -& -\\ 27node\_comparison& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 28node\_limit& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 29num\_cut\_passes& I& -& -& $\surd$& $\surd$& $\surd$& -& -\\ 30num\_cut\_passes\_at\_root& I& -& -& $\surd$& $\surd$& $\surd$& -& -\\ 31number\_before\_trust& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 32number\_strong\_branch& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 33random\_generator\_seed& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 34read\_solution\_file& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 35solution\_limit& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 36sos\_constraints& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 37time\_limit& F& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 38tree\_search\_strategy& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 39variable\_selection& S& $\surd$& -& $\surd$& $\surd$& $\surd$& -& -\\ 40\hline 41\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{ECP cuts generation}\\ 42\hline 43ecp\_abs\_tol& F& -& -& $\surd$& $\surd$& -& -& -\\ 44ecp\_max\_rounds& I& -& -& $\surd$& $\surd$& -& -& -\\ 45ecp\_probability\_factor& F& -& -& $\surd$& $\surd$& -& -& -\\ 46ecp\_rel\_tol& F& -& -& $\surd$& $\surd$& -& -& -\\ 47filmint\_ecp\_cuts& I& -& -& $\surd$& $\surd$& -& -& -\\ 48\hline 49\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{Feasibility checker using OA cuts}\\ 50\hline 51feas\_check\_cut\_types& S& -& -& $\surd$& $\surd$& $\surd$& -& -\\ 52feas\_check\_discard\_policy& S& -& -& $\surd$& $\surd$& $\surd$& -& -\\ 53generate\_benders\_after\_so\_many\_oa& I& -& -& $\surd$& $\surd$& $\surd$& -& -\\ 54\hline 55\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{MILP Solver}\\ 56\hline 57cpx\_parallel\_strategy& I& -& -& -& -& -& -& $\surd$\\ 58milp\_solver& S& -& -& -& -& -& -& $\surd$\\ 59milp\_strategy& S& -& -& -& -& -& -& $\surd$\\ 60number\_cpx\_threads& I& -& -& -& -& -& -& $\surd$\\ 61\hline 62\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{MILP cutting planes in hybrid algorithm}\\ 63\hline 642mir\_cuts& I& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 65Gomory\_cuts& I& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 66clique\_cuts& I& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 67cover\_cuts& I& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 68flow\_cover\_cuts& I& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 69lift\_and\_project\_cuts& I& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 70mir\_cuts& I& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 71reduce\_and\_split\_cuts& I& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 72\hline 73\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{NLP interface}\\ 74\hline 75nlp\_solver& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 76warm\_start& S& $\surd$& -& -& -& -& -& -\\ 77\hline 78\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{NLP solution robustness}\\ 79\hline 80max\_consecutive\_failures& I& $\surd$& -& -& -& -& -& -\\ 81max\_random\_point\_radius& F& $\surd$& -& -& -& -& -& -\\ 82num\_iterations\_suspect& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 83num\_retry\_unsolved\_random\_point& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 84random\_point\_perturbation\_interval& F& $\surd$& -& -& -& -& -& -\\ 85random\_point\_type& S& $\surd$& -& -& -& -& -& -\\ 86resolve\_on\_small\_infeasibility& F& $\surd$& -& -& -& -& -& -\\ 87\hline 88\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{NLP solves in hybrid algorithm (B-Hyb)}\\ 89\hline 90nlp\_solve\_frequency& I& -& -& -& $\surd$& -& -& -\\ 91nlp\_solve\_max\_depth& I& -& -& -& $\surd$& -& -& -\\ 92nlp\_solves\_per\_depth& F& -& -& -& $\surd$& -& -& -\\ 93\hline 94\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{Nonconvex problems}\\ 95\hline 96coeff\_var\_threshold& F& $\surd$& -& -& -& -& -& -\\ 97dynamic\_def\_cutoff\_decr& S& $\surd$& -& -& -& -& -& -\\ 98first\_perc\_for\_cutoff\_decr& F& $\surd$& -& -& -& -& -& -\\ 99max\_consecutive\_infeasible& I& $\surd$& -& -& -& -& -& -\\ 100num\_resolve\_at\_infeasibles& I& $\surd$& -& -& -& -& -& -\\ 101num\_resolve\_at\_node& I& $\surd$& -& -& -& -& -& -\\ 102num\_resolve\_at\_root& I& $\surd$& -& -& -& -& -& -\\ 103second\_perc\_for\_cutoff\_decr& F& $\surd$& -& -& -& -& -& -\\ 104\hline 105\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{Outer Approximation Decomposition (B-OA)}\\ 106\hline 107oa\_decomposition& S& -& -& $\surd$& $\surd$& $\surd$& -& -\\ 108\hline 109\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{Outer Approximation cuts generation}\\ 110\hline 111add\_only\_violated\_oa& S& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 112oa\_cuts\_scope& S& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 113oa\_rhs\_relax& F& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 114tiny\_element& F& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 115very\_tiny\_element& F& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 116\hline 117\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{Output and Loglevel}\\ 118\hline 119bb\_log\_interval& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 120bb\_log\_level& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 121file\_solution& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 122fp\_log\_frequency& F& -& -& $\surd$& $\surd$& -& -& -\\ 123fp\_log\_level& I& -& -& $\surd$& $\surd$& -& -& -\\ 124lp\_log\_level& I& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 125milp\_log\_level& I& -& -& -& -& -& -& $\surd$\\ 126nlp\_log\_at\_root& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 127nlp\_log\_level& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 128oa\_cuts\_log\_level& I& -& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 129oa\_log\_frequency& F& $\surd$& -& -& $\surd$& $\surd$& -& -\\ 130oa\_log\_level& I& $\surd$& -& -& $\surd$& $\surd$& -& -\\ 131\hline 132\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{Primal Heuristics}\\ 133\hline 134feasibility\_pump\_objective\_norm& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 135fp\_pass\_infeasible& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$\\ 136heuristic\_RINS& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 137heuristic\_dive\_MIP\_fractional& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 138heuristic\_dive\_MIP\_vectorLength& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 139heuristic\_dive\_fractional& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 140heuristic\_dive\_vectorLength& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 141heuristic\_feasibility\_pump& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 142pump\_for\_minlp& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 143\hline 144\multicolumn{1}{|c}{} & \multicolumn{8}{l|}{Strong branching setup}\\ 145\hline 146candidate\_sort\_criterion& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 147maxmin\_crit\_have\_sol& F& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 148maxmin\_crit\_no\_sol& F& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 149min\_number\_strong\_branch& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 150number\_before\_trust\_list& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 151number\_look\_ahead& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -& -\\ 152number\_strong\_branch\_root& I& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 153setup\_pseudo\_frac& F& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 154trust\_strong\_branching\_for\_pseudo\_cost& S& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& $\surd$& -\\ 155\hline 156\end{xtabular} 157} 158