\documentclass[]{article}
\begin{document}
\title{The OneMax Problem}
\date{}
\maketitle
The \emph{OneMax} Problem \cite{SE91}(or \emph{BitCounting}) is a
simple problem consisting in maximizing the number of ones of a
bitstring.
Formally, this problem can be described as finding an string
$\vec{x}=\{x_{1},x_{2},\ldots{},x_{N}\}$, with $x_{i}\in \{0,1\}$,
that maximizes the following equation:
\begin{equation}
F(\vec{x}) = \sum_{i=1}^{N}{x_{i}}
\end{equation}
\bibliographystyle{alpha}
\bibliography{onemax}
\end{document}