NEOS Server Home

NEOS Interfaces to SYMPHONY

WWW Form & Sample Submissions


The NEOS Server offers SYMPHONY for the solution of mixed integer linearly constrained optimization problems (MILPs) in MPS format. SYMPHONY solves MILPs using the branch-and-cut algorithm. Additional details and options are available in the online user manual. SYMPHONY is developed and maintained by Ted Ralphs and others. Visit the SYMPHONY page at COIN-OR for more details.

Using the NEOS Server for SYMPHONY

The user must submit a model in MPS format to solve an MILP.

Web Submission Form
MPS file
Enter the location of the MPS file (local file)
Options File
Enter the location of the options file (local file)
Additional Settings
Dry run: generate job XML instead of submitting it to NEOS
Short Priority: submit to higher priority queue with maximum CPU time of 5 minutes
E-Mail address:
Please do not click the 'Submit to NEOS' button more than once.