Lower bounds and exact algorithms for the quadratic minimum spanning tree problem

Dilson Lucas Pereira, Michel Gendreau and Alexandre Salles Da Cunha

Article (2015)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
PolyPublie URL:	https://publications.polymtl.ca/10992/
Journal Title:	Computers & Operations Research (vol. 63)
Publisher:	Elsevier
DOI:	10.1016/j.cor.2015.04.020
Official URL:	https://doi.org/10.1016/j.cor.2015.04.020
Date Deposited:	18 Apr 2023 15:07
Last Modified:	08 Apr 2025 01:37

Cite in APA 7:	Pereira, D. L., Gendreau, M., & Da Cunha, A. S. (2015). Lower bounds and exact algorithms for the quadratic minimum spanning tree problem. Computers & Operations Research, 63, 149-160. https://doi.org/10.1016/j.cor.2015.04.020
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only