Models and heuristics for a minimum arborescence problem. - Christophe Duhamel; Luis Eduardo Neves Gouveia; Pedro Moura 002; Maurício C. de Souza (Networks, 2008)

Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations. - Luis Eduardo Neves Gouveia; Pedro Moura 002 (Electron. Notes Discret. Math., 2010)

Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks. - Luis Eduardo Neves Gouveia; Pedro Moura 002; Amaro de Sousa (INOC, 2011)

Prize collecting Steiner trees with node degree dependent costs. - Luis Eduardo Neves Gouveia; Pedro Moura 002; Amaro de Sousa (Comput. Oper. Res., 2011)

Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs. - Christophe Duhamel; Luis Eduardo Neves Gouveia; Pedro Moura 002; Maurício C. de Souza (Networks, 2012)

Spanning trees with variable degree bounds. - Luis Eduardo Neves Gouveia; Pedro Moura 002; Mario Ruthmair; Amaro de Sousa (Eur. J. Oper. Res., 2014)

Preface. - Luís Gouveia 001; Pedro Moura 002 (Electron. Notes Discret. Math., 2018)

New advances and applications in deterministic and stochastic network optimization. - Luis Gouveia 001; Pedro Moura 002 (Networks, 2018)

A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints. - Bernard Fortz; Luis Gouveia 001; Pedro Moura 002 (Networks, 2022)