Luis Eduardo Neves Gouveia


AuthID: R-000-9DF

Confirmed Publications: 70



11
TITLE: On the hop constrained steiner tree problem with multiple root nodes
AUTHORS: Gouveia, L ; Leitner, M; Ljubic, I;
PUBLISHED: 2012, SOURCE: 2nd International Symposium on Combinatorial Optimization, ISCO 2012 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 7422 LNCS
INDEXED IN: Scopus CrossRef
IN MY: ORCID
12
TITLE: Reload cost trees and network design  Full Text
AUTHORS: Ioannis Gamvros; Luis Gouveia ; Raghavan, S;
PUBLISHED: 2012, SOURCE: NETWORKS, VOLUME: 59, ISSUE: 4
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
13
TITLE: A node splitting technique for two level network design problems with transition nodes
AUTHORS: Gollowitzer, S; Gouveia, L ; Ljubic, I;
PUBLISHED: 2011, SOURCE: 5th International Conference on Network Optimization, INOC 2011 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 6701 LNCS
INDEXED IN: Scopus CrossRef
IN MY: ORCID
14
TITLE: Lexicographical Minimization of Routing Hops in Telecommunication Networks
AUTHORS: Luis Gouveia ; Pedro Patricio ; Amaro de Sousa ;
PUBLISHED: 2011, SOURCE: 5th International Network Optimization Conference (INOC) in NETWORK OPTIMIZATION, VOLUME: 6701
INDEXED IN: Scopus WOS CrossRef: 2
IN MY: ORCID
15
TITLE: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs  Full Text
AUTHORS: Luis Gouveia ; Luidi Simonetti; Eduardo Uchoa;
PUBLISHED: 2011, SOURCE: MATHEMATICAL PROGRAMMING, VOLUME: 128, ISSUE: 1-2
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
16
TITLE: Models for a traveling purchaser problem with additional side-constraints  Full Text
AUTHORS: Luis Gouveia ; Ana Paias ; Stefan Voss;
PUBLISHED: 2011, SOURCE: COMPUTERS & OPERATIONS RESEARCH, VOLUME: 38, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
17
TITLE: Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models  Full Text
AUTHORS: Luis Gouveia ; Pedro Patricio ; Amaro de Sousa ;
PUBLISHED: 2011, SOURCE: INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, VOLUME: 18, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef: 4
IN MY: ORCID
18
TITLE: Prize collecting Steiner trees with node degree dependent costs  Full Text
AUTHORS: Luis Gouveia ; Pedro Moura ; Amaro de Sousa ;
PUBLISHED: 2011, SOURCE: 11th International Workshop on Project Managment and Scheduling in COMPUTERS & OPERATIONS RESEARCH, VOLUME: 38, ISSUE: 1
INDEXED IN: Scopus WOS CrossRef: 9
IN MY: ORCID
19
TITLE: Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves
AUTHORS: Luis Gouveia ; Joao Telhada;
PUBLISHED: 2011, SOURCE: 5th International Network Optimization Conference (INOC) in NETWORK OPTIMIZATION, VOLUME: 6701
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
20
TITLE: Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem  Full Text
AUTHORS: Luis Gouveia ; Ana Paias ; Dushyant Sharma;
PUBLISHED: 2011, SOURCE: JOURNAL OF HEURISTICS, VOLUME: 17, ISSUE: 1
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
Page 2 of 7. Total results: 70.

footer slogan

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service