{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:59:58Z","timestamp":1761292798700},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,4,9]],"date-time":"2011-04-09T00:00:00Z","timestamp":1302307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10951-011-0234-0","type":"journal-article","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T18:44:27Z","timestamp":1302288267000},"page":"307-318","source":"Crossref","is-referenced-by-count":7,"title":["A set partitioning reformulation of a school bus scheduling problem"],"prefix":"10.1007","volume":"14","author":[{"given":"Armin","family":"F\u00fcgenschuh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,9]]},"reference":[{"key":"234_CR1","first-page":"645","volume":"ICM III","author":"D. Applegate","year":"1998","unstructured":"Applegate, D., Bixby, R., Chvatal, V., & Cook, W. (1998). On the solution of traveling salesman problems. Documenta Mathematica ICM III, 645\u2013656.","journal-title":"Documenta Mathematica"},{"key":"234_CR2","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1137\/0209063","volume":"9","author":"B. Aspvall","year":"1980","unstructured":"Aspvall, B., & Shiloach, Y. (1980). A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. SIAM Journal on Computing, 9, 827\u2013845.","journal-title":"SIAM Journal on Computing"},{"key":"234_CR3","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"M. Balinski","year":"1964","unstructured":"Balinski, M., & Quandt, R. (1964). On an integer program for a delivery problem. Operations Research, 12, 300\u2013304.","journal-title":"Operations Research"},{"issue":"4","key":"234_CR4","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s004530010075","volume":"29","author":"R. Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R., & Rawitz, D. (2001). Efficient algorithms for integer programs with two variables per constraint. Algorithmica, 29(4), 595\u2013609.","journal-title":"Algorithmica"},{"key":"234_CR5","volume-title":"Conference paper STRC 2003, 3rd Swiss transport research conference","author":"M. Bierlaire","year":"2003","unstructured":"Bierlaire, M., Liebling, T., & Spada, M. (2003). Decision-aid methodology for the school bus routing and scheduling problem. In Conference paper STRC 2003, 3rd Swiss transport research conference, Ascona."},{"issue":"2","key":"234_CR6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/trsc.13.2.113","volume":"13","author":"L. Bodin","year":"1979","unstructured":"Bodin, L., & Berman, L. (1979). Routing and scheduling of school buses by computer. Transportation Science, 13(2), 113\u2013129.","journal-title":"Transportation Science"},{"issue":"5","key":"234_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0965-8564(94)E0006-U","volume":"28","author":"R. L. Bowerman","year":"1995","unstructured":"Bowerman, R. L., Hall, G. B., & Calamai, P. H. (1995). A multi-objective optimisation approach to school bus routing problems. Transportation Research. Part A, Policy and Practice, 28(5), 107\u2013123.","journal-title":"Transportation Research. Part A, Policy and Practice"},{"key":"234_CR8","first-page":"693","volume":"29","author":"J. Braca","year":"1997","unstructured":"Braca, J., Bramel, J., Posner, B., & Simchi-Levi, D. (1997). A\u00a0computerized approach to the New York city school bus routing problem. IIE Transactions, 29, 693\u2013702.","journal-title":"IIE Transactions"},{"key":"234_CR9","series-title":"SIAM monographs on discrete mathematics and applications","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1137\/1.9780898718515.ch4","volume-title":"The vehicle routing problem","author":"J. Bramel","year":"2002","unstructured":"Bramel, J., & Simchi-Levi, D. (2002). Set-covering-based algorithms for the capacitated VRP. In P. Toth & D. Vigo (Eds.), The vehicle routing problem. SIAM monographs on discrete mathematics and applications (pp. 85\u2013108). Philadelphia: SIAM."},{"key":"234_CR10","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1137\/S0097539791256325","volume":"23","author":"E. Cohen","year":"1994","unstructured":"Cohen, E., & Megiddo, N. (1994). Improved algorithms for linear inequalities with two variables per inequality. SIAM Journal on Computing, 23, 1313\u20131347.","journal-title":"SIAM Journal on Computing"},{"key":"234_CR11","unstructured":"Corberan, A., Fernandez, E., Laguna, M., & Marti, R. (2000). Heuristic solutions to the problem of routing school buses with multiple objectives (Technical report TR08-2000). Dep. of Statistics and OR, University of Valencia, Spain."},{"key":"234_CR12","series-title":"SIAM monographs on discrete mathematics and applications","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1137\/1.9780898718515.ch7","volume-title":"The vehicle routing problem","author":"J.-F. Cordeau","year":"2002","unstructured":"Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M. M., & Soumis, F. (2002). VRP with time windows. In P. Toth & D. Vigo (Eds.), The vehicle routing problem. SIAM monographs on discrete mathematics and applications (pp. 157\u2013193). Philadelphia: SIAM."},{"issue":"6","key":"234_CR13","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"J. Desrosiers","year":"2005","unstructured":"Desrosiers, J., & L\u00fcbbecke, M. (2005). Selected topics in column generation. Operations Research, 53(6), 1007\u20131023.","journal-title":"Operations Research"},{"key":"234_CR14","volume-title":"Network routing. Handbooks in operations research and management science","author":"J. Desrosiers","year":"1995","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995). Time constrained routing and scheduling. In M. O. Ball, T. L. Magnanti, C. L. Monma, & G. L. Nemhauser (Eds.), Network routing. Handbooks in operations research and management science (Vol.\u00a08). Amsterdam: Elsevier."},{"key":"234_CR15","unstructured":"F\u00fcgenschuh, A. (2005). The integrated optimization of school starting times and public transport (PhD Thesis). Logos Verlag, Berlin, 175 pp."},{"issue":"2","key":"234_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10100-006-0166-5","volume":"14","author":"A. F\u00fcgenschuh","year":"2006","unstructured":"F\u00fcgenschuh, A. (2006). The vehicle routing problem with coupled time windows. Central European Journal of Operations Research, 14(2), 157\u2013176.","journal-title":"Central European Journal of Operations Research"},{"issue":"3","key":"234_CR17","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/j.ejor.2007.10.055","volume":"193","author":"A. F\u00fcgenschuh","year":"2009","unstructured":"F\u00fcgenschuh, A. (2009). Solving a school bus scheduling problem with integer programming. European Journal of Operational Research, 193(3), 867\u2013884.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"234_CR18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10479-006-0066-z","volume":"147","author":"A. F\u00fcgenschuh","year":"2006","unstructured":"F\u00fcgenschuh, A., & Martin, A. (2006). A\u00a0multicriterial approach for optimizing bus schedules and school starting times. Annals of Operation Research, 147(1), 199\u2013216.","journal-title":"Annals of Operation Research"},{"key":"234_CR19","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D. R. Fulkerson","year":"1971","unstructured":"Fulkerson, D. R. (1971). Blocking and anti-blocking pairs of polyhedra. Mathematical Programming, 1, 168\u2013194.","journal-title":"Mathematical Programming"},{"key":"234_CR20","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman."},{"key":"234_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., & Schrijver, A. (1988). Geometric algorithms and combinatorial optimization. New York: Springer."},{"issue":"6","key":"234_CR22","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1137\/S0097539793251876","volume":"23","author":"D. S. Hochbaum","year":"1994","unstructured":"Hochbaum, D. S., & Naor, J. (1994). Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM Journal on Computing, 23(6), 1179\u20131192.","journal-title":"SIAM Journal on Computing"},{"key":"234_CR23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01585160","volume":"62","author":"D. S. Hochbaum","year":"1993","unstructured":"Hochbaum, D. S., Megiddo, N., Naor, J., & Tamir, A. (1993). Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Mathematical Programming, 62, 69\u201383.","journal-title":"Mathematical Programming"},{"key":"234_CR24","unstructured":"ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. Information available at http:\/\/www.cplex.com ."},{"key":"234_CR25","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01951579","volume":"23","author":"H. Keller","year":"1979","unstructured":"Keller, H., & M\u00fcller, W. (1979). Optimierung des Sch\u00fclerverkehrs durch gemischt ganzzahlige Programmierung. Zeitschrift f\u00fcr Operations Research B 23, 105\u2013122 (In German).","journal-title":"Zeitschrift f\u00fcr Operations Research B"},{"issue":"1","key":"234_CR26","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0214016","volume":"14","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C. (1985). The computational complexity of simultaneous diophantine approximation problems. SIAM Journal on Computing 14(1), 196\u2013209.","journal-title":"SIAM Journal on Computing"},{"key":"234_CR27","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1137\/0212022","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N. (1983). Towards a genuinely polynomial algorithm for linear programming. SIAM Journal on Computing, 12, 347\u2013353.","journal-title":"SIAM Journal on Computing"},{"key":"234_CR28","unstructured":"Nelson, C. G. (1978). An n log\u2009n algorithm for the two-variable-per-constraint linear programming satisfiability problem (Technical report AIM-319). Stanfort University."},{"key":"234_CR29","unstructured":"Pratt, V. R. (1977). Two easy theories whose combination is hard (Technical report). Massachusetts Institute of Technology. Cambridge, MA."},{"key":"234_CR30","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. W. Padberg","year":"1973","unstructured":"Padberg, M. W. (1973). On the facial structure of set packing polyhedra. Mathematical Programming, 5, 199\u2013215.","journal-title":"Mathematical Programming"},{"key":"234_CR31","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1145\/322276.322288","volume":"28","author":"R. Shostak","year":"1981","unstructured":"Shostak, R. (1981). Deciding linear inequalities by computing loop residues. Journal of the ACM, 28, 769\u2013779.","journal-title":"Journal of the ACM"},{"key":"234_CR32","volume-title":"SIAM monographs on discrete mathematics and applications","author":"P. Toth","year":"2002","unstructured":"Toth, P., & Vigo, D. (2002). The vehicle routing problem. In SIAM monographs on discrete mathematics and applications. Philadelphia: SIAM."},{"key":"234_CR33","unstructured":"Wikipedia. Online available at URL http:\/\/www.wikipedia.org ."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0234-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0234-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0234-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:46Z","timestamp":1559453986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0234-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,9]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["234"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0234-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,9]]}}}