Using error bounds to compare aggregated generalized transportation models

Annals of Operations Research

Volumn 146, Issue 1, 2006, Pages 119-134

  Litvinchev, Igor S ^a   Rangel, Socorro ^b  

^a RUSSIAN ACADEMY OF SCIENCES   (Russian Federation)

^b SÃO PAULO STATE UNIVERSITY UNESP   (Brazil)

Author keywords

Approximation algorithms; Clustering; Network models

Indexed keywords

EID: 33747882696     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-006-0051-6     Document Type: Conference Paper

References (17)

1. Ahuja, R.K., T.L. Magnanti, and J.B. Orlin. (1993). Nework Flows: Theory, Algorithms and Applications, Prentice Hall, NY.
2. Evans, J.R. (1979)."Aggregation in the Generalized Transportation Problem." Computers & Operations Research, 6, 199-204.
3. Francis, R.L., T.J. Lowe, and A. Tamir. (2002). "Demand Point Aggregation for Location Models." In Drezner Z. and Harnacher H.W (eds.), Facility Location: Applications and Theory, Springer, pp. 207-232.
4. Glover, F., D. Klingman, and N. Phillips. (1990). "Netform Modeling and Applications," Interfaces, 20(4), 7-27.
5. Hallefjord, A., K.O. Jornsten, and P. Varbrand (1993) "Solving Large Scale Generalized Assignment Problems - An Aggregation/Disaggregation Approach." European Journal of Operational Research, 64, 103-114.
6. Klingman, D., A. Napier, and J. Stutz. (1974). "NEIGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Problems." Management Science, 20, 814-821.
7. Leisten, R.A. (1997). "A Posteriori Error Bounds in Linear Programming Aggregation." Computers & Operations Research, 24, 1-16.
8. Litvinchev, I. and S. Rangel. (2002). "Comparing Aggregated Generalized Transportation Models Using Error Bounds." Technical Report TR2002-02-OC, UNESP, S.J. Rio Preto, Brazil. (Downloadable from website http://www.dcce.ibilce.unesp.br/~socorro/aggregation/gtp_2002/).
9. Litvinchev, I. and S. Rangel. (1999). "Localization of the Optimal Solution and a Posteriori Bounds for Aggregation." Computers & Operations Research, 26, 967-988.
10. Litvinchev, I. and V. Tsurkov. (2003). "Aggregation in Large Scale Optimization." Applied Optimization, 83, Kluwer, NY.
11. Mendelsohn, R. (1980). "Improved Bounds for Aggregated Linear Programs." Operations Research, 28, 1450-1453.
12. Montgomery, D.C. (2001). Design and Analysis of Experiments, 5th edition, John Wiley & Sons INC.
13. Norman, S.K., D.F. Rogers, and M.S. Levy. (1999). "Error Bound Comparisons for Aggregation/Disaggregation Techniques Applied to the Transportation Problem." Computers & Operations Research, 26, 1003-1014.
14. Rogers, D.F., R.D. Plante, R.T. Wong, and J.R. Evans. (1991). "Aggregation and Disaggregation Techniques and Methodology in Optimization," Operations Research, 39, 553-582.
15. Shetty, C.M. and R.W. Taylor. (1987). "Solving Large-Scale Linear Programs by Aggregation." Computers & Operations Research, 14, 385-393.
16. Zipkin, P.H. (1980a). "Bounds for Aggregating Nodes in Network Problems." Mathematical Programming, 19, 155-177.
17. Zipkin, P.H. (1980b). "Bounds on the Effect of Aggregating Variables in Linear Programs." Operations Research, 28, 403-418.