نتایج جستجو برای: assignment problem
تعداد نتایج: 912304 فیلتر نتایج به سال:
Mechanism design with agents who do not have quasi-linear preferences is an important line of research in social choice theory. Finding domains which admit truthful mechanisms is of central importance, particularly due to the well known impossibility result by Gibbard and Satterthwaite. In this paper we introduce a general framework for combinatorial assignments without money but with public va...
In this paper we develop a model for small scale examination scheduling. Beginning with a formulation of a quadratic assignment problem we show the transformation into a quadratic semi assignment problem and its application to a real world situation. Using simulated annealing we demonstrate the model's ability to generate schedules that satisfy student as well as university expectations.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید