-
Notifications
You must be signed in to change notification settings - Fork 16
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
new five algorithems TTC, SP, TTC-O, SP-O, OC #4
Conversation
…ave conflicts - not working yet
יש בעיה עם test_SP_O ו test_TTC_O - הם נתקעים בtest_random - כנראה שהם איטיים מדי. צריך לבדוק למה. |
def SP_O_condition(alloc, result_Zt1, D, p, v): | ||
return result_Zt1 * D + cp.sum([alloc.remaining_item_capacities[course] * p[j] for j, course in enumerate(alloc.remaining_items())]) + cp.sum([v[i] for i, student in enumerate(alloc.remaining_agents())]) | ||
|
||
# conditions (14) in the article using only for the SP-O |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
א. למה התנאי הזה כאן אם משתמשים בו רק ב SP_O? אפשר לשים אותו בקובץ של SP_O.
ב. יש טעות בתנאי: אתן מוסיפות כל תנאי של p[j] הרבה פעמים כמספר הסטודנטים, וכל תנאי של v[i] הרבה פעמים כמספר הקורסים.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
these four algorithems are from the article: Optimization-based Mechanisms for the Course Allocation
Problem