The common optimization INterface for Operations Research: Promoting open-source software in the operations research community

IBM Journal of Research and Development

Volumn 47, Issue 1, 2003, Pages 57-66

  Lougee Heimer, R ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTER SIMULATION; COMPUTER SOFTWARE REUSABILITY; JAVA PROGRAMMING LANGUAGE; OPTIMIZATION; SOFTWARE ENGINEERING; WEBSITES;

COMMON OPTIMIZATION INTERFACE FOR OPERATIONS RESEARCH; OPEN-SOURCE SOFTWARE;

OPERATIONS RESEARCH;

EID: 0037230473     PISSN: 00188646     EISSN: None     Source Type: Journal    
DOI: 10.1147/rd.471.0057     Document Type: Article

References (42)

1. Occupational Outlook Handbook 2000-2001 Edition, U.S. Department of Labor, Washington, DC; see http://stats.bls.gov/oco/ocos044.htm.
2. Murray Gill, M. Saunders, J. A. Tomlin, and M. Wright, "On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method," Math. Program. 36, 183-209 (1986).
3. J. J. H. Forrest and J. A. Tomlin, "Implementing Interior Point Linear Programming Methods in the Optimization Subroutine Library," IBM Syst. J. 31, No. 1, 26-38 (1987).
4. SHARE; see http://www.share.org/.
5. L. Papayanopoulos, "Linear Programming System for the OS/360," IBM New York Scientific Center, Doc. No. 69NYSC1, New York, June 1969.
6. L. Bodin, M. Grigoriadis, K. Harrow, L. Papayanopoulos, K. Spielberg, S. Torok, and W. White, "The NYLPS/MIPIS System for Mixed Integer Programming," IBM Philadelphia Scientific Center, Doc. No. 71PSC1, February 1971.
7. Thomas J. Watson, Jr., Father, Son & Co.: My Life at IBM and Beyond, Bantam Books, New York, 1990.
8. Eric S. Raymond, The Magic Cauldron, June 1999; see http://www.tuxedo.org/~esr/writings/magic-cauldron/.
9. Eric S. Raymond, The Cathedral and the Bazaar, O'Reilly, 1999; see http://www.tuxedo/org/~esr/writings/cathedral-bazaar/hacker-history/.
10. Rex Brooks; see http://www.vrml.org/TaskGroups/vrml-ipr/open_source_overview.html.
11. Concurrent Versions System; see http://www.cvshome.org/.
12. Netcraft; see http://www.netcraft.com/, July 2001.
13. Robin Lougee-Heimer, "The COIN-OR Initiative: Open Source Software for Optimization," Proceedings of the Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'01), Wye, England, 2001, pp. 307-319.
14. Robin Lougee-Heimer, Fracisco Barahona, Brenda Dietrich, J. P. Fasano, John Forrest, Robert Harder, Laszlo Ladanyi, Tobias Pfender, Theodore Ralphs, Matthew Saltzman, and Katya Scheinberg, "The COIN-OR Initiative: Open Source Accelerates Operations Research Progress," ORMS Today 28, No. 4, 20-22 (October 2001).
15. Matthew J. Saltzman, "COIN-OR: An Open-Source Library for Optimization," Programming Languages and Systems in Computational Economics and Finance, Soren S. Nielsen, Ed., Kluwer Academic Publishers, Boston, in press.
16. William Pulleybank, Brenda Dietrich, John Forrest, and Robin Lougee-Heimer, "Open Source for Optimization Software," presented at the International Symposium for Mathematical Programming (ISMP), Atlanta, August 2000; abstract, p. 33.
17. Matthew J. Saltzman, "The COIN-OR Open Solver Interface: Toward Solver Independent MIP Algorithms," presented at the INFORMS Annual Meeting, San Antonio, Fall 2000; abstract, p. 106.
18. Francisco Barahona and Ranga Anbil, "The Volume Algorithm: Producing Primal Solutions with a Subgradient Method," Research Report RC-21103(94395), IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1998.
19. Francisco Barahona and Ranga Anbil, "On Some Difficult Linear Programs Coming from Set Partitioning," Research Report RC-21410, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1999.
20. Francisco Barahona and Ranga Anbil, "Solving Large Scale Uncapacitated Facility Location Problems," Research Report RC-21515, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1999.
21. Francisco Barahona and Fabain Chudak, "Near-Optimal Solutions to Large Scale Facility Location Problems," Research Report RC-21606, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1999.
22. Laura Bahiense, Francisco Barahoma, and Oscar Porto, "Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation," Research Report RC-21847, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 2000.
23. Egon Balas, Sebastian Ceria, and Gerard Cornuejols, "A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs," Math. Program. 58, 295-324 (1993).
24. Robin Lougee-Heimer, "The COIN-OR Cut Generation Library: Toward Greater Code Reuse," presented at the INFORMS Annual Meeting, San Antonio, Fall 2000; p. 106.
25. M. Eso, L. Ladanyi, T. K. Ralphs, and L. E. Trotter, Jr., "Fully Parallel Generic Branch-and-Cut Framework," presented at the 8th SIAM Conference on Parallel Processing for Scientific Computing, March 1997.
26. M. Eso, S. Ghosh, L. Ladanyi, and J. Kalagnanam, "Bid Evaluation in Procurement Auctions with Piece-wise Linear Supply Curves," Research Report RC-22219, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 2001.
27. R. Anbil, F. Barahona, L. Ladanyi, R. Rushmeier, and J. Snowdon, "Airline Optimization," ORMS Today 27, No. 6, 26-29 (December 1999).
28. L. Ladanyi, J. J. Forrest, and J. Kalagnanam, "Column Generation Approach to the Multiple Knapsack Problem with Color Constraints," Research Report RC-22013, IBM Thomas J. Watson Research Center, York Heights, NY 2001.
29. F. Barahona and L. Ladanyi, "Branch and Cut Based on the Volume Algorithm: Steiner Trees in Graphs and Max-Cut," Research Report RC-22221, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 2001.
30. Theodore K. Ralphs and Laszlo Ladanyi, COIN/BCP User's Manual, 2001; see http://www.coin-or.org/.
31. Andrew R. Conn, Katya Scheinberg, and Ph. L. Toint, "On the Convergence of Derivative-Free Methods for Unconstrained Optimization," Approximation Theory and Optimization: Tributes to M. H. D. Powell, A. Iserles and M. Buhmann, Eds., Cambridge University Press, Cambridge, England, 1997, pp. 83-108.
32. Andrew R. Conn, Katya Scheinberg, and Ph. L. Toint, "Recent Progress in Unconstrained Nonlinear Optimization Without Derivative," Math. Program. 79, 397-414 (1997).
33. Andrew R. Conn, Katya Scheinberg, and Ph. L. Toint, "A Derivative Free Optimization Algorithm," presented at the 7th AiAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, St. Louis, 1998.
34. Robert Harder, OpenTS-Java tabu search; see http://www.coin-or.org/OpenTS/, 2001.
35. Robert Harder, "OpenTS: An Open Source Java Tabu Search Framework," presented at the INFORMS Annual Meeting, Miami, 2001.
36. George L. Nemhauser and Lawrence A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, New York, 1988.
37. Donald K. Rosenberg, "A Primer on Open-Source Software," presented at the INFORMS Annual Meeting, San Antonio, Fall 2000; abstract, p. 62; see http://www.stromian.com/.
38. Laszlo Ladanyi, J. P. Fasano, Robin Lougee-Heimer, and Matthew J. Saltzman, "COIN Installfest for Linux: A Hands-On Workshop Using Open Source Software for OR," presented at the INFORMS Annual Meeting, San Antonio, Fall 2000; abstract, p. 22.
39. Laszlo Ladanyi, J. P. Fasano, Robin Lougee-Heimer, and Matthew J. Saltzman, "COIN Installfest for Window: A Hands-On Workshop Using Open Source Software for OR," presented at the INFORMS Annual Meeting, San Antonio, Fall 2000; abstract, p. 33.
40. Laszlo Ladanyi and Ted K. Ralphs, "Branch, Cut & Price: The Next Generation," presented at the INFORMS Annual Meeting, Miami, 2001; abstract, p. 52.
41. Suvrajeet Sen and Guglielmo Lulli, "A Branch & Price Algorithm for Stochastic Lot-Sizing," presented at the INFORMS Annual Meeting, Miami, 2001; abstract, p. 52.
42. Ted K. Ralphs and Joseph C. Hartman, "Branch & Cut for Capacitated Network Routing," presented at the INFORMS Annual Meeting, Miami, 2001; abstract, p. 52.