![]() new branching rule multaggr which allows to branch on general disjunctions defined by fractional multi-aggregated variables new heuristic (heur_bound) which fixes all integer variables to their lower/upper bounds and solves the remaining LP new score in hybrid reliability pseudocost branching that prefers nonlinear variables when solving MINLPs new parameter "misc/outputorigsol" to control whether at the end of a command line run the solution should be output we can also upgrade general quadratic constraints with a single negative eigenvalue to SOC constraints we can now upgrade quadratic constraints with one bilinear term to SOC constraints the MPS reader can now handle objective constants given as (the negation of) the RHS of the objective row improved clique and variable bound heuristics added methods to compute strongly connected components with Tarjan's Algorithm the original problem can now be permuted directly after reading (if misc/permutationseed has value >= 0) the MPS reader can now read semi-integer variables, they are handled by creating bound disjunction constraints "testclusterxpress" and "testxpress" in Makefile added scripts check_xpress.awk, check_xpress.sh, evalcheck_xpress.sh and check_cluster_xpress.sh and target can now output information for BAK: Branch-and-bound Analysis Kit ![]() Tries to improve them (or external solutions) by a one-opt local search. new heuristic heur_indicator that tries to make partial solutions with indicator constraints feasible. new distribution branching rule to base decisions on row activity (normal) distribution over domain space Must be turned off by setting parameters minreliable and maxreliable to 0. Threshold for every variable before turning off strong-branching. ![]() These methodsĪre used in disjunction with the existing reliability notion that uses a fixed number as reliability tighter reliability notions introduced for reliability branching, based on pseudo-cost relative errorsĪnd comparing candidates with the best pseudo-candidate using a 2-sample student-T test. variable histories can be transferred between sub-SCIPs solved by LNS heuristics and the component presolverĪnd the main SCIP to reuse this information. possible to change objective coefficients during probing mode obbt propagator applies now additional separation and propagation in order to learn stronger and more bound tightenings extended statistic output of interactive shell by more information on diving heuristic behavior extended variable branching statistics in the interactive shell by sample variance of unit gains new heuristic distribution diving that bases its score function on the changes regarding solution density new parameter numerics/checkfeastolfac to scale feasibility tolerance when checking the feasibility of best found solutionĪfter the solving process finished (e.g., checksol in scip shell) new parameter display/allviols to print all violated constraints of the best solution during checksol in the scip shell
0 Comments
Leave a Reply. |