kumar@uunet.UU.NET (Vipin Kumar) (05/15/91)
Here is the final program of the "Workshop on Parallel Computing
of Discrete Optimization Problems" to be held at the Army High Performance
Computing Research Center at the University of Minnesota from May 22 to May 24.
The workshop is jointly sponsored by FMC corporation and the University
of Minnesota.
Please contact Kathy Olson of FMC, Minneapolis (612-337-3287) if you desire
further information about the workshop.
\documentstyle[11pt]{article}
\parindent 0.0in
\parskip 2ex
\pagestyle{myheadings}
\begin{document}
\markright{Workshop On Parallel Computing Of Discrete Optimization problems}
\begin{center}
{\LARGE Workshop On Parallel Computing Of Discrete Optimization Problems}
\vspace{2ex} \\
{\large U.S. Army High Performance Computing Research Center\\
FMC Corporation -- Naval Systems Division
}
\vspace{2ex} \\
May 22-24, 1991 Minneapolis, Minnesota
\vspace{6ex}\\
{\Large PROGRAM}
\vspace{1ex}\\
\end{center}
\rule{\textwidth}{0.015in}
\centerline{\large\sc Wednesday Morning, May 22}
\rule{\textwidth}{0.015in}
\begin{description}
\item[8:30] {\bf Registration and Coffee}
\item[9:00] {\bf Welcome and Introductory Remarks},
{\sc Marc D. Diamond}/{\it FMC Corporation -- Naval Systems Division}
\item[9:20]
{\bf The Parallel Implementation of Combinatorial Optimization
(PICO)},
{\sc Marc D. Diamond, Jeffrey C. Kimbel, Charles L. Rennolet,}
and {\sc Stephen E. Ross}/{\it FMC Corporation -- Naval Systems Division}
\item[10:00]
{\bf Analyzing the Scalability of Algorithms and Architectures for
Solving Discrete Optimization Problems on Parallel Computers}, {\sc
Vipin Kumar}/{\it University of Minnesota}, and {\sc V.N. Rao}/{\it University
of Central Florida}
\item[10:40] {\bf Break}
\item[11:00]
{\bf Finding Better Solutions
Faster Using the Chare Kernel System},
{\sc L.V. Kale}/{\it University of Illinois}
\item[11:40]
{\bf Asynchronous Parallel Algorithms for Minimum Cost Network
Problems}, {\sc David Castanon}/{\it Boston University}, and {\sc Dimitri P.
Bertsekas}/{\it Pennsylvania State University}
\item[12:20] {\bf Luncheon,} {\sc AHPCRC}\\
%\vspace{4ex}\\
\end{description}
\newpage
\rule{\textwidth}{0.015in}
\centerline{\large\bf\sc Wednesday Afternoon, May 22}
\rule{\textwidth}{0.015in}
\begin{description}
\item[2:00]
{\bf Optimizing the Airlines' Set-Partitioning Problems},
{\sc Karla Hoffman}/{\it George Mason University}, and {\sc Mandfred
Padberg}/{\it New York University}
\item[2:40]
{\bf Two Applications of Linear Programming},
{\sc Robert E. Bixby}/{\it Rice University}
\item[3:20] {\bf Break}
\item[3:40]
{\bf Computational Experience with
Parallel Algorithms Solving the Quadratic Assignment Problem},
{\sc Panos Pardalos} and {\sc Kowtha Murthy}/{\it Pennsylvania State University}
\item[4:20]
{\bf Exact Distributed Algorithms for Traveling Salesman Problems},
{\sc Donald Miller}/{\it E.I.~du Pont de Nemours and Company}, and
{\sc Joseph F. Pekny}/{\it Purdue University}
\item[5:00] {\bf Reception,} {\sc AHPCRC}
\end{description}
\rule{\textwidth}{0.015in}
\centerline{\large\sc Thursday Morning, May 23}
\rule{\textwidth}{0.015in}
\begin{description}
\item[8:30] {\bf Coffee}
\item[9:00]
{\bf Advances in
Massively Parallel Methods in Optimization},
{\sc Stavros A. Zenios}/{\it University of Pennsylvania}
\item[9:40]
{\bf An Auction Algorithm for Shortest Paths},
{\sc Dimitri P. Bertsekas}/{\it Massachusetts Institute of Technology}
\item[10:20] {\bf Break}
\item[10:40]
{\bf Parallel Solution of a Combinatorial Extreme Point Problem},
{\sc G.L. Xue} and {\sc J.B. Rosen}/{\it University of Minnesota}
\item[11:20]
{\bf Modeling of Multiprocessor Search},
{\sc Charles L. Rennolet} and {\sc Marc D. Diamond}/{\it FMC
Corporation -- Naval Systems Division}
\item[12:20] {\bf Luncheon,} {\sc Grandma's Saloon and Deli}
\end{description}
\rule{\textwidth}{0.015in}
\centerline{\large\bf\sc Thursday Afternoon, May 23}
\rule{\textwidth}{0.015in}
\begin{description}
\item[2:00]
{\bf Parallel Branch-and-Bound for State-Space
Search Problems},
{\sc V.N. Rao}/{\it University of Central Florida}, and {\sc Vipin
Kumar}/{\it University of Minnesota}
\item[2:40]
{\bf Parallel Branch and Bound on Shared Memory Multiprocessors},
{\sc Catherine Roucairol}/{\it INRIA}
\item[3:20]
{\bf Analysis of Multiple Task Search Approaches for Parallel Integer
Programming},
{\sc Russell A. Rushmeier}/{\it Georgia Institute of Technology}
\item[4:00] {\bf Break}
\item[4:20] {\bf Open Discussion}
\item[5:00] {\bf Reception,} {\sc AHPCRC}
\end{description}
\rule{\textwidth}{0.015in}
\centerline{\large\bf\sc Friday Morning, May 24}
\rule{\textwidth}{0.015in}
\begin{description}
\item[8:30] {\bf Coffee}
\item[9:00]
{\bf IDA$^*$ On the Connection Machine},
{\sc Curt Pauley}/{\it University of California, Los Angeles}
\item[9:40]
{\bf Combinatorial Optimization in
Computer Aided Design of Digital Electronic Systems},
{\sc Eugene Shragowitz}/{\it University of Minnesota}
\item[10:20] {\bf Break}
\item[11:00]
{\bf Highly Parallel Constrained Logic Programming for Mixed Integer Programming
Applications},
{\sc Ken McAloon} and {\sc Carol Tretkoff}/{\it Brooklyn College}
\item[11:40]
{\bf The ARGOT Strategy and Optimization Procedures: Introduction to
the ARGOT Learning Algorithm},
{\sc Craig Shaefer}/{\it Rowland Institute}
\item[12:20]
{\bf Concluding Remarks},
{\sc Ben Rosen}/{\it University of Minnesota}
\end{description}
\end{document}
----------------------------------------------------------------------
--
=========================== MODERATOR ==============================
Steve Stevenson {steve,fpst}@hubcap.clemson.edu
Department of Computer Science, comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell