\begin{slide}{Mixed Integer Programming}
$=$ lineare Ungleichungssysteme für \\
reelle,
\emph{ganze},
\emph{binäre} (d.h. $\{0,1\}$) Zahlen.

\begin{itemize}
\item konkrete Syntax: AMPL 
  \begin{small}
    (Robert Fourer and David M. Gay 
    and Brian W. Kernighan,
    A Modeling Language for Mathematical Programming. 
    Management Science 36  (1990) 519-554.
    \url{http://www.ampl.com/REFS/abstracts.html#amplmod})
  \end{small}
\item Solver: \url{http://www.ampl.com/},
  \url{http://www.gnu.org/software/glpk/},
  \url{http://scip.zib.de/}
\item ist NP-schwer (binäre Zahlen $\to$ CNF-SAT).
\end{itemize}

\end{slide}
