"A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching ..."

Temel Öncan, M. Hakan Akyüz, I. Kuban Altinel (2019)

> Home

Details and statistics

DOI: 10.5441/002/INOC.2019.07

access: closed

type: Conference or Workshop Paper

metadata version: 2019-06-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/inoc/OncanAA19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/inoc/OncanAA19
Temel Öncan, M. Hakan Akyüz, I. Kuban Altinel:
A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs. INOC 2019: 31-36

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.