DynG

DynG is a C++/C callable library implementing a Dynamic Graph Generation scheme for solving shortest path problems in time expanded networks. The library is designed to be used as a subproblem solver in Lagrangian Relaxation and Column Generation approaches for (Mixed) Integer Programming problems.