A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints | AVESİS

Galatasaray University Research Information System

A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints

Copy For Citation

ÖNCAN T. , Kuban Altınel İ.

Electronic Notes in Discrete Mathematics, vol.64, pp.5-14, 2018 (Refereed Journals of Other Institutions)

Publication Type: Article / Article
Volume: 64
Publication Date: 2018
Doi Number: 10.1016/j.endm.2018.01.002
Title of Journal : Electronic Notes in Discrete Mathematics
Page Numbers: pp.5-14