\documentclass[12pt]{article}
%\usepackage{fullpage}

\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{graphicx}
\usepackage{eurosym}

\usepackage{color}

\newtheorem{mydef}{Definition}
\newtheorem{lem}{Lemma}
\newtheorem{thm}{Theorem}
\newtheorem{cor}{Corollary}
\newtheorem{prop}{Proposition}
\newtheorem{theorem}{Theorem}
\newtheorem{observation}{Observation}

\usepackage{anysize}

\pagestyle{empty}

\usepackage{latexsym}



\begin{document}



\textcolor{red}{Please report here the title of the ``Invited Session'' (if applicable)}

\

\leftline {\bf {\huge Title of the contribution}}

\

\begin{flushleft}
	\textbf{{Author 1, Author 2, Author 3}}\\
	\hspace{.7cm} Department of ..., University of ..., Address, Country\\
	\hspace{.7cm} \{author1, author2, author3\}@university.xx
	
	\
	
	\textbf{Author 4}\\
	\hspace{.7cm} Company Name, Address, Country\\
	\hspace{.7cm} \{autho4\}@company.com
	\end{flushleft} 

\

\noindent \textbf{Abstract.} This is a sample abstract for submitting a contribution for a talk at ODS2018, Optimization and Decision Science, XLVIII AIRO Annual Meeting.

\noindent Abstract has to be at least 1000 characters (space included) and cannot exceed one page, including front matter, keywords and references and has to contain no formulas or pictures.

\noindent You should submit both the .tex file and the pdf version of your contribution using the on-line submission available at http://www.airoconference.it/ods2018/. All the instructions and information about deadlines and updates can be found on the same webpage.

\

\noindent \textbf{Keywords:} Keyword 1, Keyword 2, Keyword 3 (max 3 keywords)


\

\noindent \textbf{References (at least two, maximum five)}
\begin{itemize}
\item Gilmore, P.C., Gomory, R.E.: The theory and computation of knapsack functions. Opera-tions Research, 14, 1045-1074, (1966).

\item  Glover, F., Laguna, M.: Tabu Search. Boston, USA: Kluwer Academic Publishers, (1997).

\item  Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial optimization. Wiley-Interscience, New York, NY, (1988).

\item  Padberg M., Rinaldi G.: A Branch-and-cut approach to a traveling salesman problem with side constraints. Management Science, 35, 1393-1412, (1989). 

\end{itemize}
\end{document}

