Integral cycle bases for cyclic timetabling
暂无分享,去创建一个
[1] Christian Liebchen,et al. A greedy approach to compute a minimum cycle basis of a directed graph , 2005, Inf. Process. Lett..
[2] Michiel Adriaan Odijk,et al. Railway timetable generation , 1998 .
[3] Leon W P Peeters,et al. Cyclic Railway Timetable Optimization , 2003 .
[4] Kurt Mehlhorn,et al. A Faster Algorithm for Minimum Cycle Basis of Graphs , 2004, ICALP.
[5] N.R. Malik,et al. Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.
[6] Larry Stockmeyer,et al. Planar 3-colorability is polynomial complete , 1973, SIGA.
[7] Shang-Hua Teng,et al. Lower-stretch spanning trees , 2004, STOC '05.
[8] K.. Periodic network optimization with different arc frequencies , 2003 .
[10] Romeo Rizzi,et al. Minimum Weakly Fundamental Cycle Bases Are Hard To Find , 2009, Algorithmica.
[11] J. C. D. Pina. Applications of shortest path methods , 1995 .
[12] Sven de Vries,et al. Minimum Cycle Bases for Network Graphs , 2004, Algorithmica.
[13] Michiel A. Odijk,et al. A CONSTRAINT GENERATION ALGORITHM FOR THE CONSTRUCTION OF PERIODIC RAILWAY TIMETABLES , 1996 .
[14] Ma. Preprint 761-2002: On Cyclic Timetabling and Cycles in Graphs , 2003 .
[15] Christian Liebchen,et al. The First Optimized Railway Timetable in Practice , 2008, Transp. Sci..
[16] Rolf H. Möhring,et al. The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond , 2004, ATMOS.
[17] H. Whitney. On the Abstract Properties of Linear Dependence , 1935 .
[18] Ekkehard Köhler,et al. Benchmarks for Strictly Fundamental Cycle Bases , 2007, WEA.
[19] Eitan Zemel,et al. Is every cycle basis fundamental? , 1989, J. Graph Theory.
[20] Walter Ukovich,et al. A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..
[21] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[22] Kurt Mehlhorn,et al. Minimum cycle bases: Faster and simpler , 2009, TALG.
[23] Narsingh Deo,et al. Algorithms for Generating Fundamental Cycles in a Graph , 1982, TOMS.
[24] K. Brown,et al. Graduate Texts in Mathematics , 1982 .
[25] Joseph Douglas Horton,et al. A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph , 1987, SIAM J. Comput..
[26] Leo G. Kroon. Mathematics for Railway Timetabling , 2007, ERCIM News.
[27] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[28] David Maxwell Chickering,et al. On Finding a Cycle Basis with a Shortest Maximal Cycle , 1995, Inf. Process. Lett..
[29] Christian Liebchen,et al. Performance of Algorithms for Periodic Timetable Optimization , 2008 .
[30] Romeo Rizzi,et al. Classes of cycle bases , 2007, Discret. Appl. Math..
[31] Christian Liebchen. A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables , 2005, WEA.
[32] H. Kunzi,et al. Lectu re Notes in Economics and Mathematical Systems , 1975 .
[33] Rolf H. Möhring,et al. A Case Study in Periodic Timetabling , 2002, ATMOS.
[34] Joseph Douglas Horton,et al. A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid , 2002, SWAT.
[35] Christian Liebchen,et al. Finding Short Integral Cycle Bases for Cyclic Timetabling , 2003, ESA.