{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:15:18Z","timestamp":1725563718452},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_29","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"338-349","source":"Crossref","is-referenced-by-count":6,"title":["Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems"],"prefix":"10.1007","author":[{"given":"Laura","family":"Galli","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Stiller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-540-68891-4_30","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Conforti","year":"2008","unstructured":"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.\u00a05035, pp. 435\u2013449. Springer, Heidelberg (2008)"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.orl.2009.07.001","volume":"37","author":"M. Conforti","year":"2009","unstructured":"Conforti, M., Zambelli, G.: The mixing set with divisible capacities: A simple approach. Operations Research Letters\u00a037, 379\u2013383 (2009)","journal-title":"Operations Research Letters"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-006-0054-8","volume":"110","author":"M. Fischetti","year":"2006","unstructured":"Fischetti, M., Lodi, A.: Optimizing over the first Chvatal closure. Mathematical Programming\u00a0110(1), 3\u201320 (2006)","journal-title":"Mathematical Programming"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Galli, L., Stiller, S.: Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems. COGA Technical Report 009\u20132010 (2010)","DOI":"10.1007\/978-3-642-15775-2_29"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1287\/opre.44.4.570","volume":"44","author":"R. Hassin","year":"1996","unstructured":"Hassin, R.: A flow algorithm for network synchronization. Operations Research\u00a044, 570\u2013579 (1996)","journal-title":"Operations Research"},{"key":"29_CR6","first-page":"767","volume-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing","author":"S. Khot","year":"2002","unstructured":"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\u2013775. ACM Press, New York (2002)"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-77203-3_13","volume-title":"Mathematics \u2013 Key Technology for the Future","author":"E. K\u00f6hler","year":"2008","unstructured":"K\u00f6hler, E., M\u00f6hring, R., N\u00f6kel, K., W\u00fcnsch, G.: Optimization of Signalized Traffic Networks. In: Mathematics \u2013 Key Technology for the Future, pp. 179\u2013180. Springer, Heidelberg (2008)"},{"key":"29_CR8","unstructured":"Liebchen, C.: Periodic Timetable Optimization in Public Transport. Ph.D. thesis, Technische Universit\u00e4t Berlin (2006)"},{"key":"29_CR9","unstructured":"Liebchen, C., Swarat, E.: The Second Chvatal Closure Can Yield Better Railway Timetables. In: Proceedings of 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. Online Schloss Dagstuhl (2008)"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-73312-6_8","volume-title":"Computer-aided Systems in Public Transport","author":"C. Liebchen","year":"2008","unstructured":"Liebchen, C., Proksch, M., Wagner, F.H.: Performance of Algorithms for Periodic Timetable Optimization. In: Computer-aided Systems in Public Transport, pp. 151\u2013180. Springer, Heidelberg (2008)"},{"key":"29_CR11","unstructured":"Nachtigall, K.: Cutting planes for a polyhedron associated with a periodic network. DLR Technical Report 112-96\/17"},{"key":"29_CR12","unstructured":"Odijk, M.: Construction of periodic timetables, Part1: a cutting plane algorithm. TU Delft Technical Report 94-61 (1994)"},{"issue":"6","key":"29_CR13","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0191-2615(96)00005-7","volume":"30","author":"M. Odijk","year":"1996","unstructured":"Odijk, M.: A constraint generation algorithm for the construction of periodic railway timetables. Transportation Research B\u00a030(6), 455\u2013464 (1996)","journal-title":"Transportation Research B"},{"key":"29_CR14","unstructured":"Peeters, L.: Cyclic Railway Timetable Optimization. Ph.D. thesis, Erasmus University of Rotterdam (2003)"},{"key":"29_CR15","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley & Sons, Chichester (1986)"},{"issue":"4","key":"29_CR16","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0402049","volume":"2","author":"P. Serafini","year":"1989","unstructured":"Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics\u00a02(4), 550\u2013581 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T00:18:26Z","timestamp":1559521106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}