Grid-Enabled Optimization with GAMS

References

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