HEAL DSpace
An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows
DSpace/Manakin Repository
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Psaraftis, H | en |
| dc.date.accessioned | 2014-03-01T01:38:28Z | |
| dc.date.available | 2014-03-01T01:38:28Z | |
| dc.date.issued | 1983 | en |
| dc.identifier.uri | https://dspace.lib.ntua.gr/xmlui/handle/123456789/22183 | |
| dc.subject | Exact Algorithm | en |
| dc.subject | Time Window | en |
| dc.subject | dial a ride problem | en |
| dc.title | An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows | en |
| heal.type | journalArticle | en |
| heal.identifier.primary | 10.1287/trsc.17.3.351 | en |
| heal.identifier.secondary | http://dx.doi.org/10.1287/trsc.17.3.351 | en |
| heal.publicationDate | 1983 | en |
| heal.journalName | Transportation Science | en |
| dc.identifier.doi | 10.1287/trsc.17.3.351 | en |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||
