``Almost-stable'' matchings in the hospitals/residents problem with couples (Q1701229)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: ``Almost-stable matchings in the hospitals/residents problem with couples |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ``Almost-stable'' matchings in the hospitals/residents problem with couples |
scientific article |
Statements
``Almost-stable'' matchings in the hospitals/residents problem with couples (English)
0 references
22 February 2018
0 references
most-stable matching
0 references
blocking pair
0 references
polynomial-time algorithm
0 references
NP-hardness
0 references
integer programming model
0 references
constraint programming model
0 references
empirical evaluation
0 references
0 references
0.9440056
0 references
0.92385316
0 references
0.91302603
0 references
0.91064954
0 references
0.90157664
0 references
0 references
0.8781216
0 references
