Package minicp.examples

Class StableMatching

java.lang.Object

minicp.examples.SatisfactionProblem

minicp.examples.StableMatching

public class StableMatching
extends SatisfactionProblem

Stable Matching problem: Given n students and n companies, where each student (resp. company) has ranked each company (resp. student) with a unique number between 1 and n in order of preference (the lower the number, the higher the preference), say for summer internships, match the students and companies such that there is no pair of a student and a company who would both prefer to be matched with each other than with their actually matched ones. If there are no such pairs, then the matching is said to be stable. Wikipedia.

Field Summary

Fields

Modifier and Type	Field	Description
IntVar[]	company
IntVar[]	companyPref
final int	n
final int[][]	rankCompanies
final int[][]	rankStudents
IntVar[]	student
IntVar[]	studentPref

Fields inherited from class minicp.examples.SatisfactionProblem

dfs

Constructor Summary

Constructors

Constructor	Description
StableMatching(String instanceFilePath)

Method Summary

Modifier and Type	Method	Description
void	buildModel()	Creates a model for the optimization A CP model is composed of the variables + a search procedure This method should set the values for SatisfactionProblem.dfs such that SatisfactionProblem.solve() can be called afterwards
static void	main(String[] args)
SearchStatistics	solve(boolean verbose, Predicate<SearchStatistics> limit)	Runs the search defined in the SatisfactionProblem.dfs and possibly prints each found solution
String	toString()

Methods inherited from class minicp.examples.SatisfactionProblem

getNSolutions, resetNSolutions, solve, solve, solve

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Details

n

public final int n

rankCompanies

public final int[][] rankCompanies

rankStudents

public final int[][] rankStudents

student

public IntVar[] student

company

public IntVar[] company

studentPref

public IntVar[] studentPref

companyPref

public IntVar[] companyPref

Constructor Details

StableMatching

public StableMatching(String instanceFilePath)

Method Details

buildModel

public void buildModel()

Description copied from class: SatisfactionProblem

Creates a model for the optimization A CP model is composed of the variables + a search procedure This method should set the values for SatisfactionProblem.dfs such that SatisfactionProblem.solve() can be called afterwards

Specified by:

buildModel in class SatisfactionProblem

solve

public SearchStatistics solve(boolean verbose,
 Predicate<SearchStatistics> limit)

Description copied from class: SatisfactionProblem

Runs the search defined in the SatisfactionProblem.dfs and possibly prints each found solution

Overrides:

solve in class SatisfactionProblem

Parameters:

verbose - if true, prints the number of found solutions each time a new one is found

limit - a predicate called at each node that stops the search when it becomes true

Returns:

statistics related to the search

toString

public String toString()

Overrides:

toString in class Object

main

public static void main(String[] args)