Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem

D. L. Pereira, Michel Gendreau and A. S. 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/34106/
Journal Title:	Networks (vol. 65, no. 4)
Publisher:	Wiley
DOI:	10.1002/net.21580
Official URL:	https://doi.org/10.1002/net.21580
Date Deposited:	18 Apr 2023 15:07
Last Modified:	25 Sep 2024 16:17

Cite in APA 7:	Pereira, D. L., Gendreau, M., & da Cunha, A. S. (2015). Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem. Networks, 65(4), 367-379. https://doi.org/10.1002/net.21580
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)Répertoire des publications (EndNote)Simple Metadata

Statistics

Repository Staff Only