Solves using three differnent methodologies the joint *routing* and *lane reversal* allocation problem in a transportation network.
The problem is  analougus to many Network Design Problems (NDP). 

The network and demand data is provided as in TNTP data format.

To run use: `python3 -m experiments.{name of the file without extension}`

Requirements: gurobipy, networkx, scipy, numpy, pwlf
