{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:13:57Z","timestamp":1725574437855},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406990"},{"type":"electronic","value":"9783540451570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45157-0_20","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T21:38:21Z","timestamp":1294522701000},"page":"299-309","source":"Crossref","is-referenced-by-count":7,"title":["Flow Formulations for the Student Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Eddie","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Kruk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Lipman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1137\/S1052623495285886","volume":"7","author":"D.P. Bertsekas","year":"1997","unstructured":"Bertsekas, D.P., Polymenakos, L.C., Tseng, P.: An \u03b5-relaxation Method for Separable Convex Cost Network Flow Problems. SIAM J. Optim.\u00a07, 853\u2013870 (1997)","journal-title":"SIAM J. Optim."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(99)00187-0","volume":"101","author":"L. Brunetta","year":"2000","unstructured":"Brunetta, L., Conforti, M., Fischetti, M.: A Polyhedral Approach to an Integer Multicommodity Flow Problem. Discr. Appl. Math.\u00a0101, 13\u201336 (2000)","journal-title":"Discr. Appl. Math."},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BFb0055878","volume-title":"Practice and Theory of Automated Timetabling II","author":"M.W. Carter","year":"1998","unstructured":"Carter, M.W., Laporte, G.: Recent Developments in Practical Course Timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol.\u00a01408, pp. 3\u201319. Springer, Heidelberg (1998)"},{"key":"20_CR4","first-page":"231","volume-title":"Proc. 3rd IEEE Conf. on Artif. Intell. Appl.","author":"L. Davis","year":"1987","unstructured":"Davis, L., Ritter, L.: Schedule Optimization with Probabilistic Search. In: Proc. 3rd IEEE Conf. on Artif. Intell. Appl., pp. 231\u2013236. IEEE, Los Alamitos (1987)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1008667714641","volume":"12","author":"R. Leone De","year":"1999","unstructured":"De Leone, R., Meyer, R.R., Zakarian, A.: A Partitioned \u03b5-relaxation Algorithm for Separable Convex Network Flow Problems. Comput. Optim. Appl.\u00a012, 107\u2013126 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"20_CR6","first-page":"12","volume":"9","author":"D. Werra de","year":"1971","unstructured":"de Werra, D.: Construction of School Timetables by Flow Methods. INFOR \u2013 Can. J. Oper. Res. and Inf. Process.\u00a09, 12\u201322 (1971)","journal-title":"INFOR \u2013 Can. J. Oper. Res. and Inf. Process."},{"key":"20_CR7","first-page":"184","volume-title":"Proc. 16th Annu. Symp. Found. Comput. Sci.","author":"S. Even","year":"1975","unstructured":"Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems. In: Proc. 16th Annu. Symp. Found. Comput. Sci., Berkeley, CA, pp. 184\u2013193. IEEE Computer Society, Long Beach (1975)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput.\u00a05, 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"key":"20_CR9","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. J. ACM\u00a042, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1287\/opre.21.2.528","volume":"21","author":"R.C. Grinold","year":"1973","unstructured":"Grinold, R.C.: Calculating Maximal Flows in a Network with Positive Gains. Oper. Res.\u00a021, 528\u2013541 (1973)","journal-title":"Oper. Res."},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1287\/mnsc.23.6.631","volume":"23","author":"P.A. Jensen","year":"1976","unstructured":"Jensen, P.A., Bhaumik, G.: A Flow Augmentation Approach to the Network with Gains Minimum Cost Flow Problem. Manage. Sci.\u00a023, 631\u2013643 (1976\/1977)","journal-title":"Manage. Sci."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1287\/opre.10.4.476","volume":"10","author":"W.S. Jewell","year":"1962","unstructured":"Jewell, W.S.: Optimal Flow through Networks with Gains. Oper. Res.\u00a010, 476\u2013499 (1962)","journal-title":"Oper. Res."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1002\/net.3230130310","volume":"13","author":"J.G. Klincewicz","year":"1983","unstructured":"Klincewicz, J.G.: A Newton Method for Convex Separable Network Flow Problems. Networks\u00a013, 427\u2013442 (1983)","journal-title":"Networks"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0305-0548(86)90025-0","volume":"13","author":"G. Laporte","year":"1986","unstructured":"Laporte, G., Desroches, S.: The Problem of Assigning Students to Course Sections in a Large Engineering School. Comput. Oper. Res.\u00a013, 387\u2013394 (1986)","journal-title":"Comput. Oper. Res."},{"key":"20_CR16","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230010405","volume":"1","author":"M. Malek-Zavarei","year":"1971","unstructured":"Malek-Zavarei, M., Aggarwal, J.K.: Optimal Flow in Networks with Gains and Costs. Networks\u00a01, 355\u2013365 (1971\/1972)","journal-title":"Networks"},{"key":"20_CR17","first-page":"173","volume-title":"Proc. 1st Int. Seminar Oper. Res. Basque Provinces","author":"\u00c1. Mar\u00edn Gracia","year":"1986","unstructured":"Mar\u00edn Gracia, \u00c1.: Optimization of Nonlinear, Convex and Separable, Networks. In: Proc. 1st Int. Seminar Oper. Res. Basque Provinces, Zarauz, pp. 173\u2013203. Univ. Pais Vasco, Bilbao (1986)"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01584985","volume":"3","author":"J.F. Maurras","year":"1972","unstructured":"Maurras, J.F.: Optimization of the Flow through Networks with Gains. Math. Program.\u00a03, 135\u2013144 (1972)","journal-title":"Math. Program."},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0377-2217(88)90256-1","volume":"33","author":"I. Miyaji","year":"1981","unstructured":"Miyaji, I., Ohno, K., Mine, H.: Solution Method for Partitioning Students into Groups. Eur. J. Oper. Res.\u00a033, 82\u201390 (1981)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR20","first-page":"689","volume":"37","author":"G.C.W. Sabin","year":"1986","unstructured":"Sabin, G.C.W., Winter, G.K.: The Impact of Automated Timetabling on Universities \u2013 a Case Study. J. Oper. Res. Soc.\u00a037, 689\u2013693 (1986)","journal-title":"J. Oper. Res. Soc."},{"key":"20_CR21","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1137\/S1052623494265359","volume":"8","author":"J. Sun","year":"1998","unstructured":"Sun, J., Kuo, H.: Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs. SIAM J. Optim.\u00a08, 728\u2013745 (1998) (electronic)","journal-title":"SIAM J. Optim."},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/PL00011379","volume":"88","author":"P. Tseng","year":"2000","unstructured":"Tseng, P., Bertsekas, D.P.: An \u03b5-relaxation Method for Separable Convex Cost Generalized Network Flow Problems. Math. Program. Ser. A\u00a088, 85\u2013104 (2000)","journal-title":"Math. Program. Ser. A"},{"key":"20_CR23","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45157-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T15:12:12Z","timestamp":1553353932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45157-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406990","9783540451570"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45157-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}