Abstract: In many urban‐planning, geographic analysis, and engineering studies, a classical problem is finding the shortest paths within a bounded area, or the best path that goes around or through special regions, called barriers. ...

Abstract: In the discrete transportation network design problem it is often the case that some projects are mutually exclusive projects: they cannot be selected simultaneously. Some projects are concurrent projects: they have to be ...