1
TITLE: Enhancing discretized formulations: the knapsack reformulation and the star reformulation  Full Text
AUTHORS: Luis Gouveia ; Pedro Moura ;
PUBLISHED: 2012, SOURCE: TOP, VOLUME: 20, ISSUE: 1
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
2
TITLE: Models and heuristics for the k-degree constrained minimum spanning tree problem with node-degree costs  Full Text
AUTHORS: Christophe Duhamel; Luis Gouveia ; Pedro Moura ; Mauricio de Souza;
PUBLISHED: 2012, SOURCE: NETWORKS, VOLUME: 60, ISSUE: 1
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
3
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
4
TITLE: Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks
AUTHORS: Luis Gouveia ; Pedro Moura ; Amaro de Sousa ;
PUBLISHED: 2011, SOURCE: 5th International Network Optimization Conference (INOC) in NETWORK OPTIMIZATION, VOLUME: 6701
INDEXED IN: Scopus WOS CrossRef: 1
IN MY: ORCID
5
TITLE: Models and heuristics for a minimum arborescence problem  Full Text
AUTHORS: Christophe Duhamel; Luis Gouveia ; Pedro Moura ; Mauricio Souza;
PUBLISHED: 2008, SOURCE: NETWORKS, VOLUME: 51, ISSUE: 1
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID