{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T16:34:37Z","timestamp":1773678877732,"version":"3.50.1"},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1983,6,1]],"date-time":"1983-06-01T00:00:00Z","timestamp":423273600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1983,6]]},"DOI":"10.1007\/bf02592058","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:33:09Z","timestamp":1175182389000},"page":"238-242","source":"Crossref","is-referenced-by-count":5,"title":["An improved disaggregation method for transportation problems"],"prefix":"10.1007","volume":"26","author":[{"given":"P.","family":"Zipkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Raimer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02592058_CR1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/opre.13.1.82","volume":"13","author":"E. Balas","year":"1965","unstructured":"E. Balas, \u201cSolution of large scale transportation problems through aggregation,\u201dOperations Research 13 (1965) 82\u201393.","journal-title":"Operations Research"},{"key":"BF02592058_CR2","series-title":"Working paper","volume-title":"Customer aggregation in distribution modeling","author":"A. Geoffrian","year":"1976","unstructured":"A. Geoffrian, \u201cCustomer aggregation in distribution modeling\u201d Working paper no 259, Western Management Science Institute, University of California (Los Angeles, CA, 1976)."},{"key":"BF02592058_CR3","volume-title":"Aggregation in network models for transportation planning\u2014final report","author":"H. Kuhn","year":"1977","unstructured":"H. Kuhn and D. Cullen, Aggregation in network models for transportation planning\u2014final report, Mathtech, Inc. (Princeton, NJ, 1977)."},{"key":"BF02592058_CR4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01581638","volume":"19","author":"P. Zipkin","year":"1980","unstructured":"P. Zipkin, \u201cBounds for aggregating nodes in network problems\u201d,Mathematical programming 19 (1980) 155\u2013177.","journal-title":"Mathematical programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592058.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592058\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:52Z","timestamp":1558395472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["BF02592058"],"URL":"https:\/\/doi.org\/10.1007\/bf02592058","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}