%0 Journal Article %1 journals/cor/OncanP10 %A Öncan, Temel %A Punnen, Abraham P. %D 2010 %J Comput. Oper. Res. %K dblp %N 10 %P 1762-1773 %T The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm. %U http://dblp.uni-trier.de/db/journals/cor/cor37.html#OncanP10 %V 37

@article{journals/cor/OncanP10, added-at = {2020-02-18T00:00:00.000+0100}, author = {Öncan, Temel and Punnen, Abraham P.}, biburl = {https://www.bibsonomy.org/bibtex/21b3471df50dcd6acf7e1ce4fd42a9045/dblp}, ee = {https://doi.org/10.1016/j.cor.2010.01.004}, interhash = {23bfb99a687854aa3d537421d007b6e3}, intrahash = {1b3471df50dcd6acf7e1ce4fd42a9045}, journal = {Comput. Oper. Res.}, keywords = {dblp}, number = 10, pages = {1762-1773}, timestamp = {2020-02-19T11:48:01.000+0100}, title = {The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm.}, url = {http://dblp.uni-trier.de/db/journals/cor/cor37.html#OncanP10}, volume = 37, year = 2010 }