Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect ..."

Temel Öncan, I. Kuban Altinel (2018)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2018.01.002

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/OncanA18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/OncanA18
Temel Öncan, I. Kuban Altinel:
A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints. Electron. Notes Discret. Math. 64: 5-14 (2018)

a service of

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.