Solving Optimization Problems via the Web

NEOS
     Network-Enabled Optimization System server of Argonne National
     Laboratory and Northwestern University for the remote solving of
     optimization problems over the Internet, provides problem-specific
     solvers, jobs can be submitted via e-mail, ftp, or the Web interface,
     results are returned via e-mail, ftp, and/or the Web interface.
     Problem areas supported by NEOS include

• Unconstrained Optimization (solvers: NMTR, CGPplus) 
• Linear Programming (solvers: BDMLP, HOPDM, PCx, EXPRESS) 
• Integer Programming (solvers: MINLP, MIQP, XPRESS-MO) 
• Stochastic Linear Programming (solvers: AGMENTED, MSLIP)
• Bound Constrained Optimization (solvers: L-BFGS-B, LANCELOT, TRON)
• Nonlinearly Constrained Optimization (solvers: AMPL-PRI, DONLP2, LANCELOT, LOQO, MINOS, SNOPT, SNOPT-AMPL)
• Complementary Problems (solver: MILES, PATH)
• Semidefinite Programming (solvers: CSDP, DSDP, SDPA, SDPT3, SeDuMi)

Spin Glass Server
     Solves the problem of finding a ground state for a system of spin
     glasses, the problem is treated as the combinatorial optimization
     problem of finding a maximum cut in a (toroidal) grid graph