Re: fairness scheduling problem - partition nxm item scores into m groups of n items each

From: medvall <edvall@xxxxxxxxx>
Date: 19 May 2007 17:18:25 -0700

Hi Richard,

You should be able to setup the problem as a MIQP (3*9 binary vbls)
and use CPLEX - might be simpler ways to go about it though. I can
send you some sample code if you use Matlab.

Best wishes, Marcus
Tomlab Optimization Inc.
http://tomopt.com

.

References:
- fairness scheduling problem - partition nxm item scores into m groups of n items each
  - From: Richard

Prev by Date: ? analytic constraint optimization
Next by Date: Re: ? analytic constraint optimization
Previous by thread: fairness scheduling problem - partition nxm item scores into m groups of n items each
Next by thread: ? analytic constraint optimization
Index(es):
- Date
- Thread