NEOS Server Home

NEOS Interfaces to bnbs

WWW Form & Sample Submissions
Email
XML-RPC

bnbs

The NEOS Server offers BNBS for the solution of multi-stage stochastic LP problems. The problems have to be in SMPS format. Note that names should start with a letter.

BNBS uses a "Bouncing" Nested Benders Solver (decomposition). It utilizes either CPLEX, SOPLEX, or GLPK as LP solver.

The BNBS algorithm was developed by Fredrik Altenstedt. See his dissertation. Source code is available here.

This solver was implemented by Hans Mittelmann and executes at


Using the NEOS Server for BNBS

The user must submit a stochastic LP in SMPS format.
Note that names should start with a letter. BNBS cannot handle integer constraints.
This is the default commands file. Here are explanations.

Examples of problems in SMPS format can be found here.

Web Submission Form
CORE file
Enter the complete path to the
TIME file
Enter the complete path to the
STOCH file
Enter the complete path to the
Commands file (optional)
Enter the complete path to the
Algorithm
Which LP solver do you want to use?
CPLEX
GLPK
SOPLEX
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:
Please do not click the 'Submit to NEOS' button more than once.