"Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, ..."

Pierre Laroche et al. (2020)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2019.100551

access: closed

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/disopt/LarocheMMNR20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/LarocheMMNR20
Pierre Laroche, Franc Marchetti, Sébastien Martin, Anass Nagih, Zsuzsanna Róka:
Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut. Discret. Optim. 35: 100551 (2020)

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.