GAMS example code for: Recasting and optimizing intersection automation as a connected-and-automated-vehicle (CAV) scheduling problem: A sequential branch-and-bound search approach in Phase-Time-Traffic hypernetwork

This is an example code IN GAMS of a Mixed-interger linear programming formulation for fully automated intersection management.