ÖNCAN, T. Et Al. 2008. A tabu search heuristic for the generalized minimum spanning tree problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH , vol.191, no.2 , 306-319.

ÖNCAN, T., Cordeau, J., & Laporte, G., (2008). A tabu search heuristic for the generalized minimum spanning tree problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH , vol.191, no.2, 306-319.

ÖNCAN, TEMEL, Jean-Francois Cordeau, And Gilbert Laporte. "A tabu search heuristic for the generalized minimum spanning tree problem," EUROPEAN JOURNAL OF OPERATIONAL RESEARCH , vol.191, no.2, 306-319, 2008

ÖNCAN, TEMEL Et Al. "A tabu search heuristic for the generalized minimum spanning tree problem." EUROPEAN JOURNAL OF OPERATIONAL RESEARCH , vol.191, no.2, pp.306-319, 2008

ÖNCAN, T. Cordeau, J. And Laporte, G. (2008) . "A tabu search heuristic for the generalized minimum spanning tree problem." EUROPEAN JOURNAL OF OPERATIONAL RESEARCH , vol.191, no.2, pp.306-319.

@article{article, author={TEMEL ÖNCAN Et Al. }, title={A tabu search heuristic for the generalized minimum spanning tree problem}, journal={EUROPEAN JOURNAL OF OPERATIONAL RESEARCH}, year=2008, pages={306-319} }