Optimization problem in table

Правка en1, от always_first, 2016-05-13 22:53:31

Hi everybody!

Recently I've learned hungarian algorithm for solving the assignment problem, Now I'm curious about how to solve more common problem: for given n × m table select several numbers, maximizing their sum with following constraints: in each row the number of selected numbers is not less than Rmin and not more than Rmax, and for each column the number of selected numbers is not less than Cmin and not more than Cmax.

If Rmin = Rmax = 1 and Cmin = Cmax = 1 this is the standard assignment problem. But what can we say about more common case? Any thoughts about this (maybe, at least in case Rmin = Rmax = R, Cmin = Cmax = C)? Any ideas would be appreciated.

Теги optimization, assigment

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский always_first 2016-05-14 00:59:43 52
en1 Английский always_first 2016-05-13 22:53:31 763 Initial revision for English translation
ru1 Русский always_first 2016-05-13 22:10:40 799 Первая редакция (опубликовано)