\documentclass[11pt]{article}
\usepackage{dimacsmodules}

\setlength{\topmargin}{0in}     % top of paper to head (less one inch)
\setlength{\headheight}{0in}    % height of the head
\setlength{\headsep}{0in}       % head to the top of the body
\setlength{\textheight}{9.00in} % height of the body
\setlength{\oddsidemargin}{0mm} % left edge of paper to body (less one inch)
\setlength{\evensidemargin}{0mm} % ditto, even pages
\setlength{\textwidth}{6.5in}   % width of body
\setlength{\topskip}{0in}       % top of body to bottom of first line of text
%\setlength{\footheight}{0.25in} % height of footer
%\setlength{\footskip}{0.50in}   % bottom of text to bottom of foot


\newtheorem{them}{Theorem}[section]
\newtheorem{lem}[them]{Lemma}
\newtheorem{cor}[them]{Corollary}
\newtheorem{prop}[them]{Proposition}
\newtheorem{ex}{Example}[section]
\newtheorem{remark}{Remark}[section]

\newcommand{\pinch}{\vspace{-9pt}}

\begin{document}
\begin{publicity}%{}

\begin{center}
\vspace{.4in}
{\Large \bf DIMACS EDUCATIONAL MODULE SERIES}

\vspace{1.0in}

{\Large \bf MODULE 03-5}\\
{\Large \bf Communications Network Design\footnote{Research 
supported by NSF Grant DUE 97-52776}}\\
{\large \bf Date prepared:} October 17, 2003

\vspace{.5in}

{\bf Steven Cosares}\\
{\bf Hofstra University, Hempstead, New York  11549}\\
\vspace{1cm}
{\bf Fred Rispoli}\\
{\bf Dowling College, Oakdale, New York  11769}\\

\end{center}
\vfill

\end{publicity}

\newpage

\begin{center}
{\large \bf Module Description Information}
\end{center}

\begin{itemize}
\item {\bf Title:}

Communications Network Design

\item {\bf Author(s):}

Steven Cosares, Hofstra University, acsstc@hofstra.edu

Fred Rispoli, Dowling College, rispolif@dowling.edu 

\item {\bf Abstract:}

The module introduces students to a version of the Network Design
problem (NDP) that arises in the planning for communication
networks. A fixed cost is usually associated with placing or
activating the link between some pair of nodes. The variable cost
associated with a link is proportional to the number of connections
supported by the link. The objective in NDP is to find a spanning tree
for which the total of the fixed and variable costs is minimized.

\item {\bf Informal Description:}

The module covers some of the basic ideas motivating the use of
heuristic solution techniques when an optimal solution is difficult to
find. It uses the relatively simple solution techniques for the
shortest paths and minimum spanning tree problems as frameworks for
generating solutions to this complex problem.

\item {\bf Target Audience:}

The module is intended for undergraduate or graduate students taking a
course involving either Discrete Mathematics, Network Flows, Integer
Programming, or Optimization.

\item {\bf Prerequisites:}

The module is designed for students that have been introduced to some
basic concepts of networks, including the Shortest Paths problem and
the Minimum Spanning Tree problem.

\item {\bf Mathematical Field:}

Discrete Mathematics, Network Flows, Algorithms, Mathematical
Programming

\item {\bf Applications Areas:}

Telecommunications, Networking, Transportation

\item {\bf Mathematics Subject Classification:}


Primary 90C35; Secondary 65K05

\item {\bf Contact Information:}

Steven Cosares\\
Hofstra University, Hempstead, New York 11549

email: Steven.T.Cosares@Hofstra.edu

\item {\bf Other DIMACS modules related to this module:}

None

\end{itemize}





\end{document}
