ÖNCAN, T. And Kuban Altınel, İ. 2018. A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints. Electronic Notes in Discrete Mathematics , vol.64 , 5-14.

ÖNCAN, T., & Kuban Altınel, İ., (2018). A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints. Electronic Notes in Discrete Mathematics , vol.64, 5-14.

ÖNCAN, TEMEL, And İ. Kuban Altınel. "A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints," Electronic Notes in Discrete Mathematics , vol.64, 5-14, 2018

ÖNCAN, TEMEL And Kuban Altınel, İ. K. . "A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints." Electronic Notes in Discrete Mathematics , vol.64, pp.5-14, 2018

ÖNCAN, T. And Kuban Altınel, İ. (2018) . "A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints." Electronic Notes in Discrete Mathematics , vol.64, pp.5-14.

@article{article, author={TEMEL ÖNCAN And author={İ. Kuban Altınel}, title={A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints}, journal={Electronic Notes in Discrete Mathematics}, year=2018, pages={5-14} }