Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference24 articles.
1. Annamalai, C. (2016). Finding perfect matchings in bipartite hypergraphs. In Proceedings of the twenty-seventh annual acm-siam symposium on discrete algorithms (pp. 1814–1823).
2. Aronshtam, L., Ilani, H., Shufan, E. (2019). Satisfying allocation of plots to tenants. In Proceedings of the 9th multidisciplinary international conference on scheduling: Theory and applications (pp. 30–41).
3. Asadpour, A., Feige, U., & Saberi, A. (2012). Santa Claus meets hypergraph matchings. ACM Transactions on Algorithms (TALG), 8(3), 1–9.
4. Biró, P., & McDermid, E. (2010). Matching with sizes (or scheduling with processing set restrictions). In Technical report TR-2010-307.
5. Biró, P., & McDermid, E. (2014). Matching with sizes (or scheduling with processing set restrictions). Discrete Applied Mathematics, 164, 61–67.