Strong formulations for the multi-module PESP and a quadratic algorithm for graphical diophantine equation systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6346 LNCS, Issue PART 1, 2010, Pages 338-349

  Galli, Laura ^a   Stiller, Sebastian ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESULTS; DIOPHANTINE EQUATION; LINEAR LATTICES; PERIODIC EVENT SCHEDULING PROBLEMS; PUBLIC TRANSPORT; QUADRATIC ALGORITHMS; REAL-WORLD; STRONG FORMULATIONS; TIMETABLING;

MACHINERY;

ALGORITHMS;

EID: 78249282278     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15775-2_29     Document Type: Conference Paper

References (16)

1. Conforti, M., Di Summa, M., Wolsey, L.: The mixing set with divisible capacities. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 435-449. Springer, Heidelberg (2008)
2. Conforti, M., Zambelli, G.: The mixing set with divisible capacities: A simple approach. Operations Research Letters 37, 379-383 (2009)
3. Fischetti, M., Lodi, A.: Optimizing over the first Chvatal closure. Mathematical Programming 110(1), 3-20 (2006)
4. Galli, L., Stiller, S.: Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems. COGA Technical Report 009-2010 (2010)
5. Hassin, R.: A flow algorithm for network synchronization. Operations Research 44, 570-579 (1996)
6. Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 767-775. ACM Press, New York (2002)
7. Köhler, E., Möhring, R., Nökel, K., Wünsch, G.: Optimization of Signalized Traffic Networks. In: Mathematics - Key Technology for the Future, pp. 179-180. Springer, Heidelberg (2008)
8. Liebchen, C.: Periodic Timetable Optimization in Public Transport. Ph.D. thesis, Technische Universität Berlin (2006)
9. Liebchen, C., Swarat, E.: The Second Chvatal Closure Can Yield Better Railway Timetables. In: Proceedings of 8thWorkshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. Online Schloss Dagstuhl (2008)
10. Liebchen, C., Proksch, M., Wagner, F.H.: Performance of Algorithms for Periodic Timetable Optimization. In: Computer-aided Systems in Public Transport, pp. 151-180. Springer, Heidelberg (2008)
11. Nachtigall, K.: Cutting planes for a polyhedron associated with a periodic network. DLR Technical Report 112-96/17
12. Odijk, M.: Construction of periodic timetables, Part1: a cutting plane algorithm. TU Delft Technical Report 94-61 (1994)
13. Odijk, M.: A constraint generation algorithm for the construction of periodic railway timetables. Transportation Research B 30(6), 455-464 (1996)
14. Peeters, L.: Cyclic Railway Timetable Optimization. Ph.D. thesis, Erasmus University of Rotterdam (2003)
15. Schrijver, A.: Theory of Linear and Integer Programming.Wiley & Sons, Chichester (1986)
16. Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics 2(4), 550-581 (1989)