Abstract
SYMPHONY is a customizable, open-source library for solving mixed-integer linear programs (MILP) by branch, cut, and price. With its large assortment of parameter settings, user callback functions, and compile-time options, SYMPHONY can be configured as a generic MILP solver or an engine for solving difficult MILPs by means of a fully customized algorithm. SYMPHONY can run on a variety of architectures, including single-processor, distributed-memory parallel, and shared-memory parallel architectures under MS Windows, Linux, and other Unix operating systems. The latest version is implemented as a callable library that can be accessed either through calls to the native C application program interface, or through a C++ interface class derived from the COIN-OR Open Solver Interface. Among its new features are the ability to solve bicriteria MILPs, the ability to stop and warm start MILP computations after modifying parameters or problem data, the ability to create persistent cut pools, and the ability to perform rudimentary sensitivity analysis on MILPs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahmed, S. (2004). SIPLIB. Available from http://www.isye.gatech.edu/sahmed/si-plib.
Balas, E., Ceria, S., and Cornuéjols, G. (1996). Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Science, 42:1229–1246.
Bertsimas, D. and Tsitsiklis, J. (1997). Introduction to Linear Optimization. Athena Scientific, Belmont, MA, USA.
Caroe, C. and Schultz, R. (1999). Dual decomposition in stochastic integer programming. Operations Research Letters, 24:37–45.
Chen, Q. and Ferris, M. C. (2001). FATCOP: A fault tolerant Condor-PVM mixed integer program solver. SIAM Journal on Optimization, 11:1019–1036.
Climaco, J., Ferreira, C, and Captivo, M. E. (1997). Multicriteria integer programming: an overview of different algorithmic approaches. In Climaco, J., editor, Multicriteria Analysis, pages 248–258. Springer, Berlin.
Cordier, C, Marchand, H., Laundy, R., and Wolsey, L. (1997). bc-opt: A branch-and-cut code for mixed integer programs. Mathematical Programming, 86:335.
Eckstein, J., Phillips, C, and Hart, W. (2000). PICO: An object-oriented framework for parallel branch and bound. Technical Report RRR 40-2000, Rutgers University.
Ehrgott, M. and Gandibleux, X. (2000). A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum, 22:425–460.
Ehrgott, M. and Gandibleux, X. (2002). Multiobjective combinatorial optimization—theory, methodology and applications. In Ehrgott, M. and Gandibleux, X., editors, Multiple Criteria Optimization—State of the Art Annotated Bibliographic Surveys, pages 369–444. Kluwer Academic Publishers, Boston, MA.
Ehrgott, M. and Wiecek, M. M. (2004). Multiobjective programming. In Ehrgott, M., Figueira, J., and Greco, S., editors, State of the Art of Multiple Criteria Decision Analysis, Boston, MA. Kluwer Academic Publishers.
Felt, A. (2004). Stochastic linear programming data sets. Available from http://www.uwsp.edu/math/afelt/slptestset.html.
Forrest, J. (2004). Simple branch and bound. Available from http://www.coin-or.org.
Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., and Sunderam, V. (1994). PVM: Parallel Virtual Machine. The MIT Press, Cambridge, MA.
Hafer, L. (1999). bonsaiG: Algorithms and design. Technical Report SFU-CMPTTR 1999-06, Simon Frazer University Department of Computer Science.
Holmes, D. (2004). Stochastic linear programming data sets. Available from http://users.iems.nwu.edu/jrbirge/html/dholmes/post.html.
Hultberg, T. (2004). FlopC++. Available from http://www.mat.ua.pt/thh/flopc/.
Jünger, M. and Thienel, S. (2001). The ABACUS system for branch and cut and price algorithms in integer programming and combinatorial optimization. Software Practice and Experience, 30:1325–1352.
Ladányi, L. and Ralphs, T. (2001). COIN/BCP User’s Manual. Available from http://www.coin-or.org.
Linderoth, J. (1998). Topics in Parallel Integer Optimization. PhD thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA.
Linderoth, J. (2004). SUTIL.
Lougee-Heimer, R. (2003). The common optimization interface for operations research. IBM Journal of Research and Development, 47:57–66.
Makhorin, A. (2004). Introduction to GLPK. Available from http://www.gnu.org/software/glpk/glpk.html.
Nemhauser, G. L., Savelsbergh, M., and Sigismondi, G. (1994). MINTO, a Mixed INTeger Optimizer. Operations Research Letters, 15:47–58.
Ralphs, T. (2003a). Parallel branch and cut for capacitated vehicle routing. Parallel Computing, 29:607–629.
Ralphs, T. (2003b). SYMPHONY Version 4.0 User’s Manual. Technical Report 03T-006, Lehigh University Industrial and Systems Engineering.
Ralphs, T., Ladányi, L., and Saltzman, M. (2003). Parallel branch, cut, and price for large-scale discrete optimization. Mathematical Programming, 98:253–280.
Ralphs, T., Ladányi, L., and Saltzman, M. (2004a). A library hierarchy for implementing scalable parallel search algorithms. Journal of Super computing, 28:215–234.
Ralphs, T., Saltzman, M., and Wiecek, M. (2004b). An improved algorithm for biobjective integer programming and its application to network routing problems. To appear in Annals of Operations Research.
Schrage, L. and Wolsey, L. A. (1985). Sensitivity analysis for branch and bound linear programming. Operations Research, 33:1008–1023.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Ralphs, T.K., Güzelsoy, M. (2005). The Symphony Callable Library for Mixed Integer Programming. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Next Wave in Computing, Optimization, and Decision Technologies. Operations Research/Computer Science Interfaces Series, vol 29. Springer, Boston, MA . https://doi.org/10.1007/0-387-23529-9_5
Download citation
DOI: https://doi.org/10.1007/0-387-23529-9_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23528-8
Online ISBN: 978-0-387-23529-5
eBook Packages: Computer ScienceComputer Science (R0)