A Cut-based Heuristic to Produce Almost Feasible Periodic Railway Timetables
| dc.contributor.author | Liebchen, Christian | |
| dc.date.accessioned | 2021-12-17T10:06:38Z | |
| dc.date.available | 2021-12-17T10:06:38Z | |
| dc.date.issued | 2005 | |
| dc.description.abstract | We consider the problem of satisfying the maximum number of constraints of an instance of the Periodic Event Scheduling Problem (PESP). This is a key issue in periodic railway timetable construction, and has many other applications, e.g. for traffic light scheduling. | en |
| dc.identifier.issn | 2197-8085 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15571 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14344 | |
| dc.language.iso | en | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject.ddc | 510 Mathematik | en |
| dc.subject.other | periodic railway timetable optimization | en |
| dc.subject.other | approximation | en |
| dc.title | A Cut-based Heuristic to Produce Almost Feasible Periodic Railway Timetables | en |
| dc.type | Research Paper | en |
| dc.type.version | submittedVersion | en |
| tub.accessrights.dnb | free | en |
| tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
| tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
| tub.affiliation.institute | Inst. Mathematik | de |
| tub.publisher.universityorinstitution | Technische Universität Berlin | en |
| tub.series.issuenumber | 2005, 06 | en |
| tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |
| tub.subject.msc2000 | 05C90 Applications | en |
| tub.subject.msc2000 | 05C15 Coloring of graphs and hypergraphs | en |
| tub.subject.msc2000 | 90B20 Traffic problems | en |
| tub.subject.msc2000 | 90C27 Combinatorial optimization | en |