Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Temel Öncan, I. Kuban Altinel. A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints. Electronic Notes in Discrete Mathematics, 64:5-14, 2018. [doi]
Abstract is missing.