•  Índice por assuntos Lista apdio Índice cronológico  •
Anterior por data Anterior por assunto MENSAGEM Nº 01232 de 1435 Próxima por assunto > Próxima por data >

[APDIO] "Origins of NP and P", by Jack Edmonds (Wednesday, February 20, at 13:30)


•   To: <apdio@ci.uc.pt>
•   Subject: [APDIO] "Origins of NP and P", by Jack Edmonds (Wednesday, February 20, at 13:30)
•   From: José Rui Figueira <figueira@tecnico.ulisboa.pt>
•   Date: Mon, 28 Jan 2019 15:21:59 -0000

Caros membros da APDIO
Chamo a vossa atenção para a talk anunciada abaixo (Origins of NP and P", by
Jack Edmonds, Wednesday, February 20, at 13:30, Instituto Superior Técnico.
Room: to be announced soon). 
Abraços
Zé Rui Figueira

----- Forwarded message from Alexandre Francisco <aplf@ist.utl.pt> -----

Date: Mon, 28 Jan 2019 11:35:43 +0000
From: Alexandre Francisco <aplf@ist.utl.pt>
To:
Subject: "Origins of NP and P", by Jack Edmonds (Wednesday, February 20, at
13:30)

Dear All,

We are glad to have Jack Edmonds with us in Lisbon from the February 16 till
March 3.

He will give a few lectures in the course Advanced Algorithms and a talk on
the "Origins of NP and P".

The talk will be on February 20, at 13:30 (room to announce). You can read
the full talk announcement at https://thor.inesc-id.pt/jack.edmonds/

Jack Edmonds is one of the creators of combinatorial optimization. He
attended George Washington University before pursuing graduate study at the
University of Maryland. He received his master's degree in 1959 and began
work at the National Bureau of Standards (NBS). He moved to the University
of Waterloo in 1969, where he supervised a dozen PhD students. Throughout
his career, he has influenced and assisted numerous young researchers. In
the 1960s, Jack Edmonds developed a theory of matroid partition and
intersection that still stands as one of the most profound and thorough
explorations in the field. He illustrated the deep interconnections between
combinatorial minmax theorems, polyhedral structure, duality theory, and
efficient algorithms. He published many influential papers on these topics,
with the one published in 1972 on theoretical improvements in algorithmic
efficiency for network flow problems with Richard Karp leading to one of the
most well known algorithms among nowadays CS students. He was awarded the
John von Neumann Theory Prize for his contributions as a researcher and
educator in 1985. Jack Edmonds retired from teaching in 1999 and was elected
into the inaugural Fellows class of the Institute for Operations Research
and the Management Sciences.

Best regards,

Alexandre Francisco



----- End forwarded message -----






Mensagem anterior por data:
     [APDIO] Two postdoctoral positions in Mathematics at Centre of Mathematics and Applications (CMA), Universidade Nova de Lisboa, Portugal
Próxima mensagem por data:
     [APDIO] Fwd: EURO2019: Emerging Models for Transportation with Crowdsourcing
Mensagem anterior por assunto:
     [APDIO] Reminder: ORHC special issue for EURO2016 "New Advances in Health Care Applications"
Próxima mensagem por assunto:
     [APDIO] OR in practice and making a difference: join us this Friday, 10am CET (9am BST)