An experimental LPSolverWrapper class which uses glpk. For a short
demo, max flow problems are solved with it. This demo does not
demonstrates, but the main aims of this class are row and column
generation capabilities, i.e. to be a core for easily
implementable branch-and-cut a column generetion algorithms.

#include <hugo/time_measure.h>

///\file \brief Test cases for time_measure.h

///

///\todo To be extended

using namespace hugo;

int main()

{

  int j=0;

  Timer T;

  for(int i=0;i<100;i++) j+=2;

  std::cout << T << '\n';

  T.reset();

  for(int i=0;i<100;i++) j+=2;

  std::cout << T << '\n';

  return 0;

}