BEGIN:VCALENDAR
VERSION:2.0
PRODID:Baylor CMS Calendar /PHP/
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:US_Central
BEGIN:STANDARD
DTSTART:20001029T020000
RRULE:FREQ=YEARLY;WKST=MO;INTERVAL=1;BYMONTH=11;BYDAY=1SU
TZNAME:Standard Time
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20010401T020000
RRULE:FREQ=YEARLY;WKST=MO;INTERVAL=1;BYMONTH=3;BYDAY=2SU
TZNAME:Daylight Saving Time
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:Baylor_CMS_Event-115126
DTSTAMP:20210506T180754Z
SUMMARY:Dr. William Cook, "Attacking NP-hard Problems," part of the Baylor Undergraduate Lectures in Mathematics
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:Attacking NP-hard Problems=0D=0A=
=0D=0A=
Abstract: The past several decades have seen an intense study of computational tools for attacking NP-hard models in discrete optimization. We give an overview of this work, discussing current techniques, results, and research directions. The talk will highlight successful approaches adopted in the exact solution to large-scale mixed-integer programming models and the traveling salesman problem. =0D=0A=
=0D=0A=
Dr. William Cook will be the speaker in the eleventh annual Baylor Undergraduate Lecture Series in Mathematics when he visits Baylor University from November 14-17.=0D=0A=
=0D=0A=
=0D=0A=
Cook is one of the worldâ€™s foremost authorities on the Traveling Salesman Problem. This famous problem will be the subject of his public lecture on November 15.=0D=0A=
=0D=0A=
Cook did his undergraduate studies at Rutgers University graduating in 1979 with a bachelor's degree in mathematics. After earning a master's degree in operations research from Stanford University in 1980, he moved to the University of Waterloo, where he earned a Ph.D. in combinatorics and optimization in 1983. After postdoctoral studies at the University of Bonn, he joined the Cornell University faculty in 1985, moved to Columbia University in 1987, and in 1988 joined the research staff of Bell Communications Research. In 1994 he returned to academia as John von Neumann Professor at the University of Bonn, and in 1996 he moved to Rice University as Noah Harding Professor of Computational and Applied Mathematics. In 2002 he became the Chandler Family Chair in Industrial and Systems Engineering at Georgia Tech. In January 2013, he moved to the University of Pittsburgh as the John Swanson Professor of Industrial Engineering, before returning to the University of Waterloo in June 2013 as a professor in the Department of Combinatorics and Optimization, and subsequently University Professor. In 2018 he moved to Johns Hopkins University as Professor of Applied Mathematics and Statistics.=0D=0A=
=0D=0A=
Cook was elected to the National Academy of Engineering in 2011. He became a fellow of the Society for Industrial and Applied Mathematics in 2009 and of the Institute for Operations Research and the Management Sciences (INFORMS) in 2010. In 2012 he became a fellow of the American Mathematical Society. He won the Beale-Orchard-Hays Prize from the Mathematical Programming Society in 2000, and his book The Traveling Salesman Problem: A Computational Study won the Frederick W. Lanchester Prize from INFORMS in 2007.=0D=0A=
=0D=0A=
He is the founding Editor-in-Chief of the journal Mathematical Programming Computation (since 2008), and the former Editor-in-Chief of Mathematical Programming (Series B from 1993 to 2003, and Series A from 2003 to 2007).=0D=0A=
=0D=0A=
For a poster advertising Cook's lectures, click here.
LOCATION:Marrs McLean Science Building, room 301
DTSTART;TZID=US_Central:20181116T160000
DTEND;TZID=US_Central:20181116T170000
END:VEVENT
END:VCALENDAR