* Do tests according to test concept and store data in some sort of strucured format(CSV/ XML/ JSON) which could be importet in python or R. ✔
## thesis
* Begin paragraph about results and add preliminary results and observations. ✗ (moved to week 5)
* Begin paragraph about results and add preliminary results and observations. ❌ (moved to week 5)
- Create a concept how to test and which test results you want to include. (✔) (a preliminary concept)
## literature
* Read _Imposing Connectivity Constraints in Forest Planning Models_.
- Check for different constraints which could strengthen the formulation. ✗ (moved to week 5. But with focus on symmetry breaking)
- Check for different constraints which could strengthen the formulation. ❌ (moved to week 5. But with focus on symmetry breaking)
* Read _Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming_ ✔
- Different constraints to induce connectivity are compared. Try to implement some of them to compare them and see which one is best. You may see if this is related to a charateristic of your graphs. As the literature may states that for some type of graphs some approaches are better.
* Check _On imposing connectivity constraints in integer programs_ again to see if there is some other literature which you are missing. ✗ (moved to week 5)
* Check _On imposing connectivity constraints in integer programs_ again to see if there is some other literature which you are missing. ❌ (moved to week 5)
