The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a route of minimum length in the rapid transit network between...
In this paper we introduce some improvements on an approach that we described elsewhere
for solving a modification of the well-known extended rapid transit network design
problem. Firstly, we propose an integer programming model for selecting the stations to be
constructed and the links between them, in such a way that a connected rapid transit
network is obtained. Secondly, we consider a linear 0-1 programming model for determining
a route of minimum...
Download Results (CSV)