{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:40Z","timestamp":1759847560447},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T00:00:00Z","timestamp":1533600000000},"content-version":"vor","delay-in-days":1467,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["1307"],"award-info":[{"award-number":["1307"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DFG"},{"name":"DFG Research Center Matheon","award":["FZT 86"],"award-info":[{"award-number":["FZT 86"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1016\/j.tcs.2014.04.012","type":"journal-article","created":{"date-parts":[[2014,4,18]],"date-time":"2014-04-18T09:03:40Z","timestamp":1397811820000},"page":"74-83","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["Abstract flows over time: A first step towards solving dynamic packing problems"],"prefix":"10.1016","volume":"544","author":[{"given":"Jan-Philipp W.","family":"Kappmeier","sequence":"first","affiliation":[]},{"given":"Jannik","family":"Matuschke","sequence":"additional","affiliation":[]},{"given":"Britta","family":"Peis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2014.04.012_br0010","unstructured":"D. Adjiashvili, S. Bosio, R. Weismantel, Dynamic combinatorial optimization: a complexity and approximability study, 2012, Unpublished manuscript."},{"key":"10.1016\/j.tcs.2014.04.012_br0020","series-title":"Proceedings of the 11th Cologne\u2013Twente Workshop on Graphs and Combinatorial Optimization","first-page":"30","article-title":"Flows over time with negative transit times and arc release dates","author":"Bosio","year":"2012"},{"key":"10.1016\/j.tcs.2014.04.012_br0030","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","article-title":"A min\u2013max relation for submodular functions on graphs","volume":"1","author":"Edmonds","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.tcs.2014.04.012_br0040","series-title":"Proceedings of the 14th Annual ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"66","article-title":"Minimum cost flows over time without intermediate storage","author":"Fleischer","year":"2003"},{"key":"10.1016\/j.tcs.2014.04.012_br0050","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","article-title":"Efficient continuous-time dynamic network flow algorithms","volume":"23","author":"Fleischer","year":"1998","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.tcs.2014.04.012_br0060","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/j.tcs.2014.04.012_br0070","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.tcs.2014.04.012_br0080","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0166-218X(96)00122-9","article-title":"Switchdec polyhedra","volume":"76","author":"Gaillard","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2014.04.012_br0090","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0304-0208(08)73265-1","article-title":"Lattice polyhedra II: generalization, constructions and examples","volume":"65","author":"Gr\u00f6flin","year":"1982","journal-title":"North-Holland Mathematics Studies"},{"key":"10.1016\/j.tcs.2014.04.012_br0100","series-title":"Algorithms \u2013 ESA 2012","first-page":"539","article-title":"Maximum multicommodity flows over time without intermediate storage","volume":"vol. 7501","author":"Gro\u00df","year":"2012"},{"key":"10.1016\/j.tcs.2014.04.012_br0110","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/j.tcs.2014.04.012_br0120","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.tcs.2007.02.046","article-title":"Multicommodity flows over time: efficient algorithms and complexity","volume":"379","author":"Hall","year":"2007","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2014.04.012_br0130","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/BF01580250","article-title":"A generalization of max flow\u2013min cut","volume":"6","author":"Hoffman","year":"1974","journal-title":"Math. Program."},{"key":"10.1016\/j.tcs.2014.04.012_br0140","series-title":"Polyhedral Combinatorics","first-page":"197","article-title":"On lattice polyhedra III: blockers and anti-blockers of lattice clutters","author":"Hoffman","year":"1978"},{"key":"10.1016\/j.tcs.2014.04.012_br0150","series-title":"Proceedings of the 5th Hungarian Colloquium on Combinatorics","first-page":"593","article-title":"On lattice polyhedra","author":"Hoffman","year":"1978"},{"key":"10.1016\/j.tcs.2014.04.012_br0160","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","article-title":"The quickest transshipment problem","volume":"25","author":"Hoppe","year":"2000","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.tcs.2014.04.012_br0170","series-title":"Algorithms and Computation","first-page":"433","article-title":"Abstract flows over time: a first step towards solving dynamic packing problems","volume":"vol. 7676","author":"Kappmeier","year":"2012"},{"key":"10.1016\/j.tcs.2014.04.012_br0180","series-title":"Line planning and connectivity","author":"Karbstein","year":"2013"},{"key":"10.1016\/j.tcs.2014.04.012_br0190","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/net.10112","article-title":"Minimum-cost dynamic flows: the series-parallel case","volume":"43","author":"Klinz","year":"2004","journal-title":"Networks"},{"key":"10.1016\/j.tcs.2014.04.012_br0200","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S1366-5545(03)00005-X","article-title":"Mixed truck delivery systems with both hub-and-spoke and direct shipment","volume":"39","author":"Liu","year":"2003","journal-title":"Transp. Res. Part E, Logist. Transp. Rev."},{"key":"10.1016\/j.tcs.2014.04.012_br0210","series-title":"Integer Programming and Combinatorial Optimization","first-page":"97","article-title":"A polynomial algorithm for weighted abstract flow","volume":"vol. 5035","author":"Martens","year":"2008"},{"key":"10.1016\/j.tcs.2014.04.012_br0220","series-title":"Proceedings of the 7th Annual ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"490","article-title":"A polynomial algorithm for abstract maximum flow","author":"McCormick","year":"1996"},{"key":"10.1016\/j.tcs.2014.04.012_br0230","series-title":"Progress in Combinatorial Optimization","first-page":"315","article-title":"Total dual integrality from directed graphs, crossing families and sub-and supermodular functions","author":"Schrijver","year":"1984"},{"key":"10.1016\/j.tcs.2014.04.012_br0240","series-title":"Research Trends in Combinatorial Optimization","first-page":"451","article-title":"An introduction to network flows over time","author":"Skutella","year":"2009"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514002916?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514002916?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T17:24:30Z","timestamp":1538673870000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397514002916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":24,"alternative-id":["S0304397514002916"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2014.04.012","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2014,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Abstract flows over time: A first step towards solving dynamic packing problems","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2014.04.012","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}