{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:33:41Z","timestamp":1725978821188},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319899190"},{"type":"electronic","value":"9783319899206"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-89920-6_42","type":"book-chapter","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T16:59:40Z","timestamp":1527267580000},"page":"309-315","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Hypergraph Network Simplex Algorithm"],"prefix":"10.1007","author":[{"given":"Isabel","family":"Beckenbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,26]]},"reference":[{"issue":"2\u20133","key":"42_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","volume":"42","author":"G Gallo","year":"1993","unstructured":"Gallo, G., Longo, G., Pallottino, S., & Nguyen, S. (1993). Directed hypergraphs and applications. Discrete Applied Mathematics, 42(2\u20133), 177\u2013201.","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR2","unstructured":"Bornd\u00f6rfer, R., Reuther, M., Schlechte, T., & Weider, S. (2011). A hypergraph model for railway vehicle rotation planning. In OASIcs-OpenAccess Series in Informatics, 20."},{"issue":"1","key":"42_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01581090","volume":"57","author":"RG Jeroslow","year":"1992","unstructured":"Jeroslow, R. G., Martin, K., Rardin, R. L., & Wang, J. (1992). Gainfree Leontief substitution flow problems. Mathematical Programming, 57(1), 375\u2013414.","journal-title":"Mathematical Programming"},{"key":"42_CR4","unstructured":"Bornd\u00f6rfer, R., & Heismann, O. (2011). Minimum Cost Hyperassignments with Applications to ICE\/IC Rotation Planning. In OR (pp. 59\u201364)."},{"key":"42_CR5","unstructured":"Heismann, O. (2014). The hypergraph assignment problem, Doctoral dissertation, Technische Universit\u00e4t Berlin."},{"issue":"2","key":"42_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF02614371","volume":"78","author":"R Cambini","year":"1997","unstructured":"Cambini, R., Gallo, G., & Scutell\u00e0, M. G. (1997). Flows on hypergraphs. Mathematical Programming, 78(2), 195\u2013217.","journal-title":"Mathematical Programming"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89920-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T17:14:03Z","timestamp":1527268443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89920-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319899190","9783319899206"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89920-6_42","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2018]]}}}