{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:13:01Z","timestamp":1774415581539,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,6,24]],"date-time":"2006-06-24T00:00:00Z","timestamp":1151107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10479-006-0051-6","type":"journal-article","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T16:33:21Z","timestamp":1151080401000},"page":"119-134","source":"Crossref","is-referenced-by-count":2,"title":["Using error bounds to compare aggregated generalized transportation models"],"prefix":"10.1007","volume":"146","author":[{"given":"Igor S.","family":"Litvinchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Socorro","family":"Rangel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,24]]},"reference":[{"key":"51_CR1","unstructured":"Ahuja, R.K., T.L. Magnanti, and J.B. Orlin. (1993). Network Flows: Theory, Algorithms and Applications, Prentice Hall, NY."},{"key":"51_CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0305-0548(79)90003-0","volume":"6","author":"J.R. Evans","year":"1979","unstructured":"Evans, J.R. (1979).\u201cAggregation in the Generalized Transportation Problem.\u201d Computers & Operations Research, 6, 199\u2013204.","journal-title":"Computers & Operations Research"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Francis, R.L., T.J. Lowe, and A. Tamir. (2002). \u201cDemand Point Aggregation for Location Models.\u201d In Drezner Z. and Hamacher H.W (eds.), Facility Location: Applications and Theory, Springer, pp. 207\u2013232.","DOI":"10.1007\/978-3-642-56082-8_7"},{"issue":"4","key":"51_CR4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1287\/inte.20.4.7","volume":"20","author":"F. Glover","year":"1990","unstructured":"Glover, F., D. Klingman, and N. Phillips. (1990). \u201cNetform Modeling and Applications,\u201d Interfaces, 20(4), 7\u201327.","journal-title":"Interfaces"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Hallefjord, A., K.O. Jornsten, and P. Varbrand (1993) \u201cSolving Large Scale Generalized Assignment Problems\u2014An Aggregation\/Disaggregation Approach.\u201d European Journal of Operational Research, 64, 103\u2013114.","DOI":"10.1016\/0377-2217(93)90011-B"},{"key":"51_CR6","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"Klingman, D., A. Napier, and J. Stutz. (1974). \u201cNETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Problems.\u201d Management Science, 20, 814\u2013821.","journal-title":"Management Science"},{"key":"51_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0305-0548(96)00034-2","volume":"24","author":"R.A. Leisten","year":"1997","unstructured":"Leisten, R.A. (1997). \u201cA Posteriori Error Bounds in Linear Programming Aggregation.\u201d Computers & Operations Research, 24, 1\u201316.","journal-title":"Computers & Operations Research"},{"key":"51_CR8","unstructured":"Litvinchev, I. and S. Rangel. (2002). \u201cComparing Aggregated Generalized Transportation Models Using Error Bounds.\u201d Technical Report TR2002-02-OC, UNESP, S.J. Rio Preto, Brazil. (Downloadable from website http:\/\/www.dcce.ibilce.unesp.br\/~socorro\/aggregation\/gtp_2002\/ .)"},{"key":"51_CR9","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1016\/S0305-0548(99)00027-1","volume":"26","author":"I. Litvinchev","year":"1999","unstructured":"Litvinchev, I. and S. Rangel. (1999). \u201cLocalization of the Optimal Solution and a Posteriori Bounds for Aggregation.\u201d Computers & Operations Research, 26, 967\u2013988.","journal-title":"Computers & Operations Research"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Litvinchev, I. and V. Tsurkov. (2003). \u201cAggregation in Large Scale Optimization.\u201d Applied Optimization, 83, Kluwer, NY.","DOI":"10.1007\/978-1-4419-9154-6"},{"key":"51_CR11","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1287\/opre.28.6.1450","volume":"28","author":"R. Mendelsohn","year":"1980","unstructured":"Mendelsohn, R. (1980). \u201cImproved Bounds for Aggregated Linear Programs.\u201d Operations Research, 28, 1450\u20131453.","journal-title":"Operations Research"},{"key":"51_CR12","unstructured":"Montgomery, D.C. (2001). Design and Analysis of Experiments, 5th edition, John Wiley & Sons INC."},{"key":"51_CR13","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1016\/S0305-0548(99)00025-8","volume":"26","author":"S.K. Norman","year":"1999","unstructured":"Norman, S.K., D.F. Rogers, and M.S. Levy. (1999). \u201cError Bound Comparisons for Aggregation\/Disaggregation Techniques Applied to the Transportation Problem.\u201d Computers & Operations Research, 26, 1003\u20131014.","journal-title":"Computers & Operations Research"},{"key":"51_CR14","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/opre.39.4.553","volume":"39","author":"D.F. Rogers","year":"1991","unstructured":"Rogers, D.F., R.D. Plante, R.T. Wong, and J.R. Evans. (1991). \u201cAggregation and Disaggregation Techniques and Methodology in Optimization,\u201d Operations Research, 39, 553\u2013582.","journal-title":"Operations Research"},{"key":"51_CR15","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0305-0548(87)90035-9","volume":"14","author":"C.M. Shetty","year":"1987","unstructured":"Shetty, C.M. and R.W. Taylor. (1987). \u201cSolving Large-Scale Linear Programs by Aggregation.\u201d Computers & Operations Research, 14, 385\u2013393.","journal-title":"Computers & Operations Research"},{"key":"51_CR16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01581638","volume":"19","author":"P.H. Zipkin","year":"1980a","unstructured":"Zipkin, P.H. (1980a). \u201cBounds for Aggregating Nodes in Network Problems.\u201d Mathematical Programming, 19, 155\u2013177.","journal-title":"Mathematical Programming"},{"key":"51_CR17","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1287\/opre.28.2.403","volume":"28","author":"P.H. Zipkin","year":"1980b","unstructured":"Zipkin, P.H. (1980b). \u201cBounds on the Effect of Aggregating Variables in Linear Programs.\u201d Operations Research, 28, 403\u2013418.","journal-title":"Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0051-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-006-0051-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0051-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:32Z","timestamp":1559153252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-006-0051-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,24]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s10479-006-0051-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,24]]}}}