Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14277
For citation please use:
Main Title: Finding Short Integral Cycle Bases for Cyclic Timetabling
Author(s): Liebchen, Christian
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15504
http://dx.doi.org/10.14279/depositonce-14277
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Cyclic timetabling for public transportation companies is usually modeled by the periodic event scheduling problem. To deduce a mixed-integer programming formulation, artificial integer variables have to be introduced. There are many ways to define these integer variables.
Subject(s): paths and cycles
applications
transportation, logistics
traffic problems
mixed integer programming
combinatorial optimization
Issue Date: 2003
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 05C38 Paths and cycles
05C90 Applications
90B06 Transportation, logistics
90B20 Traffic problems
90C11 Mixed integer programming
90C27 Combinatorial optimization
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2003, 12
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-012-2003.pdf
Format: Adobe PDF | Size: 228.96 kB
DownloadShow Preview
Thumbnail
Report-012-2003.ps.gz
Format: Unknown | Size: 249.53 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.