Grid-enabled optimization with GAMS

INFORMS Journal on Computing

Volumn 21, Issue 3, 2009, Pages 349-362

  Bussieck, Michael R ^a   Ferris, Michael C ^b   Meeraus, Alexander ^c  

^a GAMS Software GmbH   (Germany)

^b University of Wisconsin Madison   (United States)

^c GAMS Development Corporation   (United States)

Author keywords

Algebraic modeling language; Decomposition; Grid computing

Indexed keywords

EID: 68749117571     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1090.0340     Document Type: Article

References (42)

1. Achterberg T., T. Koch, A. Martin. 2006. MIPLIB 2003. Oper. Res. Lett. 34(4) 1361-372.
2. Alba E. 2005. Parallel Metaheuristics: A New Class of Algorithms. John Wiley & Sons, Hoboken, NJ.
3. Anstreicher K. M., N. W. Brixius, J.-P. Goux, J. Linderoth. 2002. Solving large quadratic assignment problems on computational grids. Math. Programming 9(3) 563-588.
4. Applegate D., R. Bixby, V. Chvátal, W. Cook. 1998. On the solution of traveling salesman problems. Documenta Mathematica J. Extra Vol. 3(17) 645-656.
5. Bertsekas D. P., J. N. Tsitsiklis. 1989. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs, NJ.
6. Bisschop J. J., A. Meeraus. 1982. On the development of a general algebraic modeling system in a strategic planning environment. J.-L. Goffin, J.-M. Rousseau, eds. Applications: Mathematical Programming Studies, Vol. 20. North Holland, Amsterdam, 1-29.
7. Bixby R. E., E. A. Boyd, R. R. Indovina. 1992. MIPLIB: A test set of mixed integer programming problems. SIAM News 25 16.
8. Bixby R. E., S. Ceria, C. M. McZeal, M. W. P Savelsbergh. 1998. An updated mixed integer programming library: MIPLIB 3.0. Optima 58(June) 12-15.
9. Bixby R. E., W. Cook A. Cox, E. K. Lee. 1997. Computational experience with parallel mixed integer programming in a distributed environment. Ann. Oper. Res. 90 19-43.
10. Bosch R. A. 2003. Mindsharpener. Optima 70(June) 48-9.
11. Bussieck M. R., A. Meeraus. 2003. General algebraic modeling system (GAMS). J. Kallrath, ed. Modeling Languages in Mathematical Optimization. Kluwer Academic Publishers, Norwell, MA, 137-157.
12. Bussieck M. R., A. Meeraus. 2007. Algebraic modeling for IP and MIP (GAMS). Ann. Oper. Res. 149(1) 49-56.
13. Butnariu D., Y. Censor, S. Reich. 2001. Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications. Studies in Computational Mathematics, Vol. 8. Elsevier Science, Amsterdam.
14. Censor Y., S. A. Zenios. 1997. Parallel Optimization: Theory, Algorithms and Applications. Oxford University Press, New York.
15. Chen Q., M. C. Ferris. 2000. FATCOP: A fault tolerant Condor-PVM mixed integer programming solver. SIAMJ. Optimization 11(4) 1019-1036.
16. Chen Q., M. C. Ferris, J. T. Linderoth. 2001. FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver. Ann. Oper. Res. 103(1-4) 17-32.
17. Codsi G., K. R. Pearson. 1988. GEMPACK: General-purpose software for applied general equilibrium and other economic modellers. Comput. Econom. 1(3) 189-207.
18. Dantzig G. B., P. Wolfe. 1960. Decomposition principle for linear programs. Oper. Res. 8(1) 101-111.
19. Dolan E. D., R. Fourer J.-P Goux, T. S. Munson. 2008. Kestrel: An interface from optimization modeling systems to the NEOS server. INFORMS J. Comput. 20(4) 525-538.
20. Eckstein J. 1994. Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5. SIAM J. Optimization 4(4) 794-814.
21. Eckstein J., C. A. Phillips, W. E. Hart. 2001. PICO: An objectoriented framework for parallel branch and bound. Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications. Studies in Computational Mathematics, Vol. 8. Elsevier Science, Amsterdam, 219-265.
22. Epema D. H. J., M. Livny, R. van Dantzig, X. Evers, J. Pruyne. 1996. A worldwide flock of Condors: Load sharing among workstation clusters. Future Generation Comput. Systems 12(1) 53-65.
23. Ferris M. C., C. T. Maravelias, A. Sundaramoorthy 2009. Simultaneous batching and scheduling using dynamic decomposition on a grid. INFORMS J. Comput. 21(3) 398-410.
24. Ferris M. C., T. S. Munson. 2000. Modeling languages and Condor: Metacomputing for optimization. Math. Programming 88(3) 487-506.
25. Ferris M. C., G. Pataki, S. Schmieta. 2001. Solving the Seymour problem. Optima 66(October) 1-6.
26. Foster I., C. Kesselman, eds. 1999. The Grid: Blueprint for a Future Computing Infrastructure. Morgan Kaufmann, San Francisco.
27. Fourer R., D. M. Gay, B. W. Kernighan. 1990. A modeling language for mathematical programming. Management Sci. 36(5) 519-554.
28. Gardner M. 2001. The Colossal Book of Mathematics. W. W. Norton & Company, New York.
29. Gendron B., T. G. Crainic. 1994. Parallel branch-and-bound algorithms: Survey and synthesis. Oper. Res. 42(6) 1042-1066.
30. Goldberg D. E. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Professional, Upper Saddle River, NJ.
31. Goux J.-P, S. Kulkarni, J. Linderoth, M. Yoder. 2000. An enabling framework for master-worker applications on the computational grid. Proc. Ninth IEEE Sympos. High Performance Distributed Comput. (HPDC9), Pittsburgh, IEEE Computing Society, Washington, DC, 43-50.
32. Grama, A., V. Kumar. 1995. Parallel search algorithms for discrete optimization problems. ORSA J. Comput. 7(4) 365-385.
33. Grama A., V. Kumar. 1999. State of the art in parallel search techniques for discrete optimization problems. IEEE Trans. Knowledge Data Engrg. 11(1) 28-35.
34. Liebchen C. 2006. Personal communication. (April).
35. Linderoth J. T., E. K. Lee, M. W P. Savelsbergh. 2001. A parallel, linear programming-based heuristic for large-scale set partitioning problems. INFORMSJ. Comput. 13(3) 191-209.
36. Linderoth J. T., A. Shapiro, S. J. Wright. 2006. The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142(1) 215-241.
37. Litzkow M. J., M. Livny, M. W. Mutka. 1988. Condor-A hunter of idle workstations. Proc. 8th Internat. Conf. Distributed Comput. Systems (ICDCS), San Jose, CA, IEEE Press, Los Alamitos, CA, 104-111.
38. Livny M., R. Raman. 1999. High-throughput resource management. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco, 311-337.
39. Markowitz H. M. 1952. Portfolio selection. J. Finance 7(1) 77-91.
40. Nemhauser G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. John Wiley & Sons, New York.
41. Ralphs T. K., L. Ladányi, M. J. Saltzman. 2003. Parallel branch, cut, and price for large-scale discrete optimization. Math. Programming 98(1-3) 253-280.
42. Wright S. J. 2001. Solving optimization problems on computational grids. Optima 65(May) 8-13.