Solving Mixed Linear Programs with Pseudo Boolean Solvers

From International Center for Computational Logic
Revision as of 15:41, 2 March 2015 by Norbert Manthey (talk | contribs) (Page created automatically by parser function on page Thema3417)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Toggle side column

Solving Mixed Linear Programs with Pseudo Boolean Solvers

Topic no longer available
Industrial problems can be specified in many formal languages. One such language is used to describe mixed integer programs.

This project should translate problems from mixed integer programming into the pseudo boolean language, and afterwards the performance of the solvers for the difference should be compared.