« Back to Record
Citation APA

Feremans, C., Labbé, M., & Laporte, G. (2004). The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. Networks (New York), 43(2), 71-86. doi:10.1002/net.10105


Permalink

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/10555

Feremans, C., Labbé, M., & Laporte, G. (2004). The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. Networks (New York), 43(2), 71-86. doi:10.1002/net.10105