![]() |
![]() |
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 AlgorithmsAdd to your list(s) Download to your calendar using vCal
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. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsBritGrav 15 Contemporary History Seminar IMA West Midlands BranchOther talksTBC Extending the Lax type operator for finite W-algebras Modelling uncertainty in image analysis. Geometry of alternating projections in metric spaces with bounded curvature Sylow branching coefficients for symmetric groups Ultrafast, all-optical, and highly efficient imaging of molecular chirality |