Finding Maximum Stable Matchings for the Student-Project Allocation Problem with Preferences Over Projects

This paper proposes an efficient algorithm to find a maximum weakly stable matching for the Student-Project Allocation Problem with Preferences over Projects. We consider the problem as a constraint satisfaction problem and solve it using a local search a

  • PDF / 84,240,709 Bytes
  • 499 Pages / 439.37 x 666.142 pts Page_size
  • 86 Downloads / 190 Views

DOWNLOAD

REPORT

Recommend Documents
The Generalized Median Stable Matchings: Finding Them Is Not That Easy

150 40 14MB

On Finding Balanced Bicliques via Matchings

162 21 11MB

Three-dimensional stable matching with cyclic preferences

214 28 275KB

Problem Finding

170 52 54MB

Approximating Stable Matchings with Ties of Bounded Size

164 102 7MB

Sequencing Problem with Maximum Lateness Criterion

150 7 436KB

Zero-Point Maximum Allocation Method for Solving Intuitionistic Fuzzy Transportation problem

140 69 261KB

Dynamic Edge User Allocation with User Specified QoS Preferences

188 71 424KB

Stable roommates with narcissistic, single-peaked, and single-crossing preferences

145 81 899KB

Maximum Satisfiability Problem

194 26 33MB

Vector maximum problem

170 51 6KB

Maximum Matching Problem

182 9 23MB