Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/4647| Title: | A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem | Authors: | Gouveia, Luís Requejo, Cristina |
Keywords: | Design of centralized networks; Quality of service constraints; Hop constraints; Lagrangean relaxation; Multicommodity flows | Issue Date: | 2001 | Citation: | European Journal of Operational Research. 132:3 (2001) 539-552 | URI: | https://hdl.handle.net/10316/4647 | DOI: | 10.1016/S0377-2217(00)00143-0 | Rights: | openAccess |
| Appears in Collections: | FCTUC Matemática - Artigos em Revistas Internacionais |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| file1c1efcc2768a47c1875872ae34fe4df7.pdf | 125.88 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
44
checked on Jul 1, 2024
WEB OF SCIENCETM
Citations
44
checked on Jul 2, 2024
Page view(s)
340
checked on Jul 16, 2024
Download(s)
338
checked on Jul 16, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.