added constraint to mtz: force all inactive nodes to have order 0
found better upper bound for number of outgoing edges of an active node

use k instead of n
however, an even better bound would be k-u_i because at least u_i nodes
 are above the current node in the tree
This works better than using just k when k is small, worse when k is large
updated gitignore file
updated gitignore file
updated gitignore
REBASEME: Whitespace
REBASEME: Remove swap file
REBASEME: Apply outgoing edge upper bound to SCF as well
REBASEME: Tighter bound
REBASEME: TODO notes for tighter SCF bounds
Initial setup for MCF
Add comments describing upcoming MCF constraints
started report, general formulation and mtz done
removed unused tex output files
included b&b nodes in test.py output
ever tried ever failed. no matter?
not a substantial improvement of scf, but something
mcf works, but it is slow
improved comments
Move report to doc/ subfolder