SYMPHONY
Introduction
Single- or Multi-Process Optimization over Networks or SYMPHONY is a
generic Mixed Integer Linear Programs(MILP) solver. It is also a callable
library and it implements both sequential and parallel versions of the branch,
cut and price algorithm. It may be used to solve specific types of problems
like Traveling Salesperson Problem, Vehicle Routing Problem, Mixed Postman
Problem etc. It can use OSI interface to use LP solvers like CLP, CPLEX, GLPK
and XPRESS. Symphony is also a part of
COIN
(Computational Infrastructure for OR).
SYMPHONY Availability
SYMPHONY, along with its complete documentation and some specific applications,
is available under Common Public Licence from its project page at
COIN-OR.
SYMPHONY in COR@L
In COR@L, Symphony is available on
all machines. Instructions and hints to use it are available in the coral-wiki
here.
Related publications/presentations
T.K.R.,
SYMPHONY Version 5.1 User's Manual, Lehigh University
Industrial and Systems Engineering Technical Report 04T-009 (2004) (
PDF).
J.T. Linderoth and T.K.R.,
Noncommercial Software for Mixed-Integer Linear Programming, to
appear in
Integer Programming: Theory and Practice, John Karlof,
ed. (2005) (Working paper version:
PS PDF).
T.K.R.,
Parallel Branch and Cut, in
Parallel
Combinatorial Optimization, E. Talbi, ed. (2006) (Working paper
version:
PS PDF)
T.K.R. and M. Guzelsoy,
The SYMPHONY Callable Library for Mixed Integer Programming, The
Proceedings of the Ninth INFORMS Computing Society Conference (2005), 61
(Working paper version:
PS PDF).
T.K.R.,
Parallel Branch and Cut for Capacitated Vehicle Routing,
Parallel Computing,
29 (2003), 607 (Working paper version:
PS PDF).
L. Ladanyi, T.K.R., and L.E. Trotter Jr.,
Branch, Cut, and Price: Sequential and Parallel, in
Computational Combinatorial Optimization, D. Naddef and M. Juenger, eds., Springer, Berlin (2001), 223 (
PS PDF).