SYMPHONY

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.

SYMPHONY was developed and is maintained by Ted Ralphs and others.

Additional details and options are available in the online user manual and the SYMPHONY page at COIN-OR.

Using the NEOS Server for SYMPHONY/MPS

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)

Comments

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:

Auto-Fill

Please do not click the 'Submit to NEOS' button more than once.