Changelog

0.4.3	Adds compilation of mis_bpm_nolimit, which does not have an iteration limit
0.4.2	Adds compilation of mis_bpm_noxy, which does not use the oldy or oldX
subroutines
0.4.1	This version contains a critical bug fix in the yOldFathoms function. 
It also reduces the output from the BPM method to one line and outputs the
current state of the graph at each proecssed node. 
0.4     This is a major re-organization of much of the code, implementing many
more functions instead of one large main(). The algorithm itself has not been changed, 
except for removing an extraneous clique search and replacing the goto statements with
continue statements (which are not really any better from a procedural programming 
perspective)
0.3.4	bug fix in code for copying the old X values
0.3.3	cleaned up the code a bit, no longer creates two executables, passing
-1 as the best known size will only bound the graph once and not branch. 
0.3.2	changed name to mis_bpm, 'make bound_bpm' now creates a version of the
code that does one bound then exits
0.3.1	switched to dsyevr instead of dsyevd to perform eigenvector
decomposition
0.3.0	 based on testing of the codes in 0.2.0 this version is a large
rewrite of the code, implementing 0.1.8 with oldy, oldX, and dsyevd
0.2.0	consists of several versions of the code, each adding one new feature.
oldy attempts to use y values from a previous bound (the current graph must be
a subgraph of this previous graph) to bound the cureent node. oldX attempts to
use X from a previous graph (again, the new graph must be a subgraph of the
old) to start the new bounding algorithm. force01 forces variables to 0 or 1
using the last Z found by removing columns and rows, then attempts to fathom
the node by checking if it's PD with diagonal entries corresponding to the best
known solution + 0.99. dsyevd uses dsyevd instead of dsyevx to attain
eigenvector decompositions. this was found to be faster on problems with many
edges. always_bound attempts to bound the graph at every node of the tree:
this slowed things down, but a better choice than every 5 levels may exist. 
0.1.8	Termination criterion changed to use a faster method of checking 
if Z is PD (dpotrf). 
0.1.7 	Merged the files auglag_theta.c and bandb.c and made use of global
pointers for all matrices and vectors to reduce the number of mallocs. This
makes the code a bit harder to read, but saves time overall. 
0.1.6	Moved mallocs for functions forceDual and eigSplit into auglag_theta
so they only need ot be done once. THis should reduce system overhead. 
0.1.5	Fixed code so that if primal error becomes too large, sigma is
decreased.  
0.1.4	Changed fathoming requirements to <(known best)+0.99 instead of
<(known best)+0.95. This should help bandb fathom nodes higer in the tree. 
0.1.3	Fixed another memory leak, edges[i] at the end ot thetabound. Removed
unneeded memory allocation for Zfix in auglag_theta
0.1.2	Tightened tolerance, reduced ouput in verbose mode
0.1.1 	Fixed a memory leak
0.1	First implementation wit dsyevdx
