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.
5 #include <sage_graph.h>
6 #include <for_each_macros.h>
12 typedef SageGraph Graph;
14 Graph::Node n1=g.addNode();
15 Graph::Node n2=g.addNode();
18 std::cout << g.id(n) << " ";
20 std::cout << std::endl;
21 FOR_EACH_LOC(Graph::NodeIt, m, g) {
22 std::cout << g.id(m) << " ";
24 std::cout << std::endl;