University of Birmingham > Talks@bham > Optimisation and Numerical Analysis Seminars > Multi-dimensional vector assignment problems (MVA) : Complexity, Approximation and Algorithms

Multi-dimensional vector assignment problems (MVA) : Complexity, Approximation and Algorithms

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

  • UserTrivikram Dokka (Lancaster University)
  • ClockWednesday 19 February 2020, 12:00-13:00
  • HousePhysics West 103.

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

I will formally introduce Multi-dimensional (binary) vector assignment problems (MVA) and discuss some motivation to study these problems. I will then review the complexity and approximability results on MVA . As major part of my talk I will discuss column generation approaches both exact and heuristic to solve the problem. I will also discuss some ongoing and future work to solve large scale assignment problems.

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:

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 from the University of Cambridge.