Timeline for Implementing fractional separation in SCIP
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 11 at 8:14 | comment | added | Matheus Diógenes Andrade | So, if you want to impose the "one call per node", you could keep in an outer scope some flag (maybe a dictionary mapping integers to booleans) telling whether a BB node of a given ID (not sure what is the function for this in scip) was already explored by your separation algorithm, if so, simply disable the separation. | |
| Oct 11 at 8:14 | comment | added | Matheus Diógenes Andrade | The behaviour "one call per node" is not the default mode, the default is to call the fractional separation until there is no more fractional violated solutions. For instance, if at node $n_i^k$, for the $i$-th node of depth $k$ from the BB tree, the solution $x_i^k$ violates some fractional cut $H(x_i^k) \leqslant 0$ (such cut detected by your separation algorithm) will be added to the current linear problem, and the execution proceeds within the same node, until your separation algorithm is not albe to find some $H(x_i^k) > 0$, and then the BB nodes derivation continues.+ | |
| S Oct 11 at 7:56 | review | First answers | |||
| Oct 11 at 12:03 | |||||
| S Oct 11 at 7:56 | history | answered | Bubbler | CC BY-SA 4.0 |