You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Memory usage increases quite rapidly and can reach up to several hundreds of GB for hard instances. The complete search tree is kept in memory during the execution of the program. However, explored parts of the tree could be released to free up memory.
Doing so would require reorganizing node selection, which is currently managed via IDs, e.g. in backtracking:
Memory usage increases quite rapidly and can reach up to several hundreds of GB for hard instances. The complete search tree is kept in memory during the execution of the program. However, explored parts of the tree could be released to free up memory.
Doing so would require reorganizing node selection, which is currently managed via IDs, e.g. in backtracking:
TwoStepBranchingProcedure/tsbp/src/BranchAndBound.cpp
Line 855 in 2fa7152
Implementing #4 would also help in this regard.
The text was updated successfully, but these errors were encountered: