Stable assignment with couples: Parameterized complexity and local search
Authors:
- Dániel MarxDMDániel Marx
- Ildikó SchlotterISIldikó Schlotter
- 1 February 2011
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 8 (1) , 25-40
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Scheduling with processing set restrictions: A surveyInternational Journal of Production Economics, 2008
- Searching the k-change neighborhood for TSP is W[1]-hardOperations Research Letters, 2008
- Parallel machine scheduling with job assignment restrictionsNaval Research Logistics (NRL), 2006
- The Stable Roommates Problem with TiesJournal of Algorithms, 2002
- The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic DesignAmerican Economic Review, 1999
- Color-codingJournal of the ACM, 1995
- NP-complete stable matching problemsJournal of Algorithms, 1990
- An efficient algorithm for the “stable roommates” problemJournal of Algorithms, 1985
- The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game TheoryJournal of Political Economy, 1984
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962