Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/4647
DC FieldValueLanguage
dc.contributor.authorGouveia, Luís-
dc.contributor.authorRequejo, Cristina-
dc.date.accessioned2008-09-01T11:35:51Z-
dc.date.available2008-09-01T11:35:51Z-
dc.date.issued2001en_US
dc.identifier.citationEuropean Journal of Operational Research. 132:3 (2001) 539-552en_US
dc.identifier.urihttps://hdl.handle.net/10316/4647-
dc.description.urihttp://www.sciencedirect.com/science/article/B6VCT-433NPMB-5/1/196f81f226d90a29e26b752ae26fc897en_US
dc.format.mimetypeaplication/PDFen
dc.language.isoengeng
dc.rightsopenAccesseng
dc.subjectDesign of centralized networksen_US
dc.subjectQuality of service constraintsen_US
dc.subjectHop constraintsen_US
dc.subjectLagrangean relaxationen_US
dc.subjectMulticommodity flowsen_US
dc.titleA new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problemen_US
dc.typearticleen_US
dc.identifier.doi10.1016/S0377-2217(00)00143-0-
item.openairetypearticle-
item.fulltextCom Texto completo-
item.languageiso639-1en-
item.grantfulltextopen-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:FCTUC Matemática - Artigos em Revistas Internacionais
Files in This Item:
File Description SizeFormat
file1c1efcc2768a47c1875872ae34fe4df7.pdf125.88 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.