Docstoc

Greetings_

Document Sample
Greetings_ Powered By Docstoc
					Greetings,

On Monday 13.7.2009 at 11:10, we are holding our, last for this year, IEM Seminar
in building 16 room 150.


The speaker: Prof. George Steiner, Professor of Production and Management Science
McMaster University, Canda

Title: Scheduling and the Traveling Salesman Problem on Permuted Monge Matric


Please join us

Gilad

-------------------------------------------------------------------------------------
Abstract

A large variety of scheduling problems has recently been shown to be solvable as a
special case of the Traveling Salesman Problem (TSP) on permuted Monge matrices.
Although the TSP on permuted Monge matrices is known to be strongly NP-hard, we
present polynomial-time solutions for many of the special cases generated by the
scheduling problems. We also show that a simple subtour-patching heuristic is
asymptotically optimal for the TSP on permuted Monge matrices under some mild
technical conditions.

Biographical Sketch
George Steiner received his Ph.D. in Combinatorics and Optimization from the
University of Waterloo, Canada in 1982 and his M.Sc. in Mathematics from Loránd
Eötvös University of Budapest, Hungary, in 1971. After having worked in industry
for close to 10 years, he joined the Faculty of Business at McMaster University in
1981, where he has been a Full Professor since 1992. His research interests include
scheduling, algorithms on graphs and partially ordered sets and combinatorial
optimization. He has published in numerous scientific journals including Operations
Research, Management Science, IIE Transactions, SIAM J. of Computing, SIAM J. of
Discrete Mathematics, Mathematics of Operations Research, Discrete Applied
Mathematics, Annals of Operations Research, J. of Graph Theory, J. of Algorithms,
Theoretical Computer Science and others.

				
DOCUMENT INFO
Shared By:
Categories:
Tags:
Stats:
views:10
posted:11/16/2011
language:English
pages:1