"Perfect matching in bipartite hypergraphs subject to a demand graph."

Lior Aronshtam, Hagai Ilani, Elad Shufan (2023)

> Home

Details and statistics

DOI: 10.1007/S10479-022-05073-9

access: closed

type: Journal Article

metadata version: 2023-02-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/anor/AronshtamIS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/AronshtamIS23
Lior Aronshtam, Hagai Ilani, Elad Shufan:
Perfect matching in bipartite hypergraphs subject to a demand graph. Ann. Oper. Res. 321(1): 39-48 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.