Pedro Moura

According to our database, Pedro Moura authored at least 9 papers between 2008 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints.

Bernard Fortz, Luis Gouveia, Pedro Moura

Networks, 2022

2018

New advances and applications in deterministic and stochastic network optimization.

Luis Gouveia, Pedro Moura

Networks, 2018

Preface.

Luís Gouveia, Pedro Moura

Electron. Notes Discret. Math., 2018

2014

Spanning trees with variable degree bounds.

Luis Eduardo Neves Gouveia, Pedro Moura, Mario Ruthmair, Amaro de Sousa

Eur. J. Oper. Res., 2014

2012

Models and heuristics for the <i>k</i> -degree constrained minimum spanning tree problem with node-degree costs.

Christophe Duhamel, Luis Eduardo Neves Gouveia, Pedro Moura, Maurício C. de Souza

Networks, 2012

2011

Prize collecting Steiner trees with node degree dependent costs.

Luis Eduardo Neves Gouveia, Pedro Moura, Amaro de Sousa

Comput. Oper. Res., 2011

Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks.

Luis Eduardo Neves Gouveia, Pedro Moura, Amaro de Sousa

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations.

Luis Eduardo Neves Gouveia, Pedro Moura

Electron. Notes Discret. Math., 2010

2008

Models and heuristics for a minimum arborescence problem.

Christophe Duhamel, Luis Eduardo Neves Gouveia, Pedro Moura, Maurício C. de Souza

Networks, 2008