{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T20:01:45Z","timestamp":1726516905486},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0012-365x(96)00194-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"481-486","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["Multicommodity network flow with jump constraints"],"prefix":"10.1016","volume":"165-166","author":[{"given":"Jean-Fran\u00e7ois","family":"Maurras","sequence":"first","affiliation":[]},{"given":"Yann","family":"Vax\u00e8s","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00194-X_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230080107","article-title":"Multicommodity network flows: a survey","volume":"8","author":"Assad","year":"1978","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(96)00194-X_BIB2","first-page":"66","article-title":"Networks with side constraints: an LU factorization update","author":"Barr","year":"1986","journal-title":"Ann. Soc. Logist. Eng."},{"key":"10.1016\/S0012-365X(96)00194-X_BIB3","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1287\/opre.41.4.669","article-title":"A primal partitioning solution for multicommodity network flow problems","volume":"41","author":"Farvolden","year":"1993","journal-title":"Oper. Res."},{"key":"10.1016\/S0012-365X(96)00194-X_BIB4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/net.3230010404","article-title":"A generalized upper-bounding algorithm for multicommodity network flow problem","volume":"1","author":"Hartman","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(96)00194-X_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/opre.26.2.209","article-title":"Survey of linear cost multicommodity network flows","volume":"26","author":"Kennington","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/S0012-365X(96)00194-X_BIB6","first-page":"82","volume":"Vol. 26","author":"Lawler","year":"1976"},{"key":"10.1016\/S0012-365X(96)00194-X_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230070102","article-title":"A generalized upper-bounding approach to a communications network planning problem","volume":"7","author":"McCallum","year":"1977","journal-title":"Networks"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600194X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600194X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:12Z","timestamp":1556130432000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9600194X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":7,"alternative-id":["S0012365X9600194X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00194-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}