A Constraint Programming Approach to the Hospitals / Residents Problem-Reference-Cited by-同舟云学术

A Constraint Programming Approach to the Hospitals / Residents Problem

Published:2007 Issue: Volume: Page:155-170
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
language:
Short-container-title:

Author:

Manlove David F.,O’Malley Gregg,Prosser Patrick,Unsworth Chris

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-72397-4_12

Reference31 articles.

1. Aldershof, B., Carducci, O.M., Lorenc, D.C.: Refined inequalities for stable marriage. Constraints 4, 281–292 (1999)

2. Bessière, C., Régin, J.-C.: Arc consistency for general constraint networks: Preliminary results. In: Proceedings of IJCAI ’97, vol. 1, pp. 398–404 (1997)

3. Lecture Notes in Computer Science;I. Brito,2005

4. Lecture Notes in Computer Science;I. Brito,2006

5. Canadian Resident Matching Service. How the matching algorithm works. Web document available at http://www.carms.ca/matching/algorith.htm

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computing relaxations for the three-dimensional stable matching problem with cyclic preferences;Constraints;2023-06

2. A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences;Constraints;2022-06-01

3. Towards an optimal controllers' response time in a software‐defined network‐enabled data center;International Journal of Communication Systems;2021-09-23

4. Improving solution times for stable matching problems through preprocessing;Computers & Operations Research;2021-04

5. Matching formulation of the Staff Transfer Problem: meta-heuristic approaches;OPSEARCH;2019-12-12