VM-alloc branch-and-bound

ProblemGenerator can now do a First-Fit allocation so that the generated initial mapping is not that bad

Added wrapper to ILP solvers Gurobi and Lp_solve

Other sorting methods for VMs, VMs without an initial PM.

Added different sorting methods for VMs, similarly to the way it works by PMs.

VMs without an initial PM are now supported, allocating these never cause migrations, regardless of the destination.

Migration limit, iterative cost computation.

Introduced a new parameter with which the number of migrations allowed can be limited.

The cost of an allocation is now computed iteratively, instead of recalculating the total cost at each allocation. The number of PMs turned on and the amount of migrations are tracked in two member variables.

Additional PM sorting options.

The new methods for PM sorting can be set with the PMSortMethod parameter.

Presentation, new branch version, Makefile.

Added a presentation to the trunk version.

Added a new branch version (also containing a Makefile).
Features of the new version:
- Linux compatibility when creating files
- Logging option for cost changes
- Timeout
- Bound threshold

Created a new folder structure.

Currently working and documented version is in the "trunk" folder.

The version in the "branch" folder can contain experimental, undocumented changes.

Added TODO list.

Added some compiler directives.

Done in order to make the code compile under both Visual C++ and GCC.

The function localtime() is considered unsafe by Visual C++, however, the safe version localtime_s() is not implemented in GCC.

Slight changes to improve portability