Profile-Based Optimal Matchings in the Student/Project Allocation Problem (Q2946056): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Two algorithms for the student-project allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair Matchings and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-maximal matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation bounds for the student-project allocation problem with preferences over projects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profile-Based Optimal Matchings in the Student/Project Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics of Matching Under Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Student-project allocation with preferences over projects / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture by Gale about one-sided matching problems / rank
 
Normal rank

Latest revision as of 18:15, 10 July 2024

scientific article
Language Label Description Also known as
English
Profile-Based Optimal Matchings in the Student/Project Allocation Problem
scientific article

    Statements

    Identifiers