Solving Mixed Linear Programs with Pseudo Boolean Solvers

Theses

• Suggested Thesis Topics
• Completed Theses
  • Algebra und Diskrete Strukturen
  • Automatentheorie
  • Computational Logic
  • Logische Programmierung und Argumentation
  • Verifikation und formale quantitative Analyse
  • Wissensbasierte Systeme
• Currently Ongoing Theses

Toggle side column

Solving Mixed Linear Programs with Pseudo Boolean Solvers

Topic no longer available

•   Supervisor Norbert Manthey
•   Start

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.