ÖNCAN, T. And Punnen, A. P. 2010. The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm. COMPUTERS & OPERATIONS RESEARCH , vol.37, no.10 , 1762-1773.

ÖNCAN, T., & Punnen, A. P., (2010). The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm. COMPUTERS & OPERATIONS RESEARCH , vol.37, no.10, 1762-1773.

ÖNCAN, TEMEL, And Abraham P. Punnen. "The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm," COMPUTERS & OPERATIONS RESEARCH , vol.37, no.10, 1762-1773, 2010

ÖNCAN, TEMEL And Punnen, Abraham P. . "The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm." COMPUTERS & OPERATIONS RESEARCH , vol.37, no.10, pp.1762-1773, 2010

ÖNCAN, T. And Punnen, A. P. (2010) . "The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm." COMPUTERS & OPERATIONS RESEARCH , vol.37, no.10, pp.1762-1773.

@article{article, author={TEMEL ÖNCAN And author={Abraham P. Punnen}, title={The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm}, journal={COMPUTERS & OPERATIONS RESEARCH}, year=2010, pages={1762-1773} }