University of Birmingham > Talks@bham > Optimisation and Numerical Analysis Seminars > Optimal assignments with supervisions

Optimal assignments with supervisions

Add to your list(s) Download to your calendar using vCal

  • UserAdi Niv
  • ClockFriday 07 December 2018, 13:10-14:00
  • HouseNuffield G17.

If you have a question about this talk, please contact Sergey Sergeev.

This talk has been canceled/deleted

In this talk I provide a new graph theoretic proof of the tropical Jacobi identity, recently obtained in my joint work with Marianne Akian and Stephane Gaubert. We also develop an application of this theorem to optimal assignments with supervisions, in a joint work with Marie Maccaig and Sergey Sergeev. More precisely, we consider the problem of optimal assignment of multiple tasks to one team, or daily tasks to multiple teams, where each team has a supervisor task or a supervised task.

This talk is part of the Optimisation and Numerical Analysis Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.