Open
Description
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:
Implementing #4 would also help in this regard.