On the Complexity of Train Assignment Problems

Erlebach, T; Gantenbein, M; Hürlimann, D; Neyer, G; Pagourtzis, A; Penna, P; Schlude, K; Steinhöfel, K; Taylor, D; Widmayer, P

dc.contributor.author	Erlebach, T	en
dc.contributor.author	Gantenbein, M	en
dc.contributor.author	Hürlimann, D	en
dc.contributor.author	Neyer, G	en
dc.contributor.author	Pagourtzis, A	en
dc.contributor.author	Penna, P	en
dc.contributor.author	Schlude, K	en
dc.contributor.author	Steinhöfel, K	en
dc.contributor.author	Taylor, D	en
dc.contributor.author	Widmayer, P	en
dc.date.accessioned	2014-03-01T02:49:04Z
dc.date.available	2014-03-01T02:49:04Z
dc.date.issued	2001	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34286
dc.subject	Approximate Algorithm	en
dc.subject	Assignment Problem	en
dc.subject	Cost Efficiency	en
dc.subject	Satisfiability	en
dc.title	On the Complexity of Train Assignment Problems	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-45678-3_34	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-45678-3_34	en
heal.publicationDate	2001	en
heal.abstract	We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions by hand, a time- consuming task which is too slow for interaction with the schedule cre- ators. Further, it is difficult to measure how efficient the manual solu- tions are. We consider	en
heal.journalName	International Symposium on Algorithms and Computation	en
dc.identifier.doi	10.1007/3-540-45678-3_34	en