{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:26Z","timestamp":1740099506947,"version":"3.37.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030184995"},{"type":"electronic","value":"9783030185008"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18500-8_20","type":"book-chapter","created":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T15:02:47Z","timestamp":1567090967000},"page":"151-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Assigning Students to Schools for an Internship"],"prefix":"10.1007","author":[{"given":"Michael","family":"Stiglmayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"G\u00f6rtz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kathrin","family":"Klamroth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,30]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/net.3230080107","volume":"8","author":"A Assad","year":"1978","unstructured":"Assad, A.: Multicommodity network flows \u2013 a survey. Networks 8, 37\u201391 (1978)","journal-title":"Networks"},{"key":"20_CR2","volume-title":"A branch-and-cut algorithm for multicommodity capacitated fixed charge network design","author":"M Chouman","year":"2008","unstructured":"Chouman, M., Crainic, T.G., Gendron, B.: A branch-and-cut algorithm for multicommodity capacitated fixed charge network design. Technical report, Universit\u00e9 de Montr\u00e9al (2008)"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"WM Hirsch","year":"1968","unstructured":"Hirsch, W.M., Dantzig, G.B.: The fixed charge problem. Naval Res. Logist. Q. 15(3), 413\u2013424 (1968). \n                    https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/nav.3800150306","journal-title":"Naval Res. Logist. Q."},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D Kim","year":"1999","unstructured":"Kim, D., Pardalos, P.M.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4), 195\u2013203 (1999)","journal-title":"Oper. Res. Lett."},{"key":"20_CR5","unstructured":"Ministerium f\u00fcr Schule und Bildung des Landes Nordrhein-Westfalen: Das Bildungsportal: Lehrkraft in Nordrhein-Westfalen (2018). \n                    https:\/\/www.schulministerium.nrw.de\/docs\/LehrkraftNRW\/Lehramtsstudium\/Praxiselemente\/Praxissemester\/index.html\n                    \n                  . Accessed 09 Jul 2018"},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"KG Murty","year":"1968","unstructured":"Murty, K.G.: Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16(2), 268\u2013279 (1968). \n                    http:\/\/www.jstor.org\/stable\/168755","journal-title":"Oper. Res."},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10589-007-9060-x","volume":"39","author":"AG Nahapetyan","year":"2008","unstructured":"Nahapetyan, A.G., Pardalos, P.M.: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Comput. Optim. Appl. 39(1), 37\u201350 (2008). \n                    http:\/\/dx.doi.org\/10.1007\/s10589-007-9060-x","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1002\/net.10068","volume":"41","author":"F Ortega","year":"2003","unstructured":"Ortega, F., Wolsey, L.A.: A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41(3), 143\u2013158 (2003). http:\/\/dx.doi.org\/10.1002\/net.10068","journal-title":"Networks"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18500-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T15:05:21Z","timestamp":1567091121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18500-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030184995","9783030185008"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18500-8_20","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}