%0 Journal Article %1 journals/networks/FeremansLL04 %A Feremans, Corinne %A Labbé, Martine %A Laporte, Gilbert %D 2004 %J Networks %K %N 2 %P 71-86 %T The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. %U http://dblp.uni-trier.de/db/journals/networks/networks43.html#FeremansLL04 %V 43

@article{journals/networks/FeremansLL04, added-at = {2023-12-12T20:40:00.000+0100}, author = {Feremans, Corinne and Labbé, Martine and Laporte, Gilbert}, biburl = {https://www.bibsonomy.org/bibtex/2b8a24ea3dda97ed7384f71c5cfa0a03f/admin}, ee = {https://doi.org/10.1002/net.10105}, interhash = {3289a2153f14e8da739c1ba2858d46cc}, intrahash = {b8a24ea3dda97ed7384f71c5cfa0a03f}, journal = {Networks}, keywords = {}, number = 2, pages = {71-86}, timestamp = {2023-12-12T20:40:00.000+0100}, title = {The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm.}, url = {http://dblp.uni-trier.de/db/journals/networks/networks43.html#FeremansLL04}, volume = 43, year = 2004 }