#### Filter Results:

- Full text PDF available (44)

#### Publication Year

1997

2017

- This year (3)
- Last 5 years (29)
- Last 10 years (60)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende
- Discrete Applied Mathematics
- 2009

Given an undirected graph G with penalties associated with its vertices and costs associated with its edges, a Prize Collecting Steiner (PCS) tree is either an isolated vertex of G or else any tree of G, be it spanning or not. The weight of a PCS tree equals the sum of the costs for its edges plus the sum of the penalties for the vertices of G not spanned… (More)

1 ABSTRACT The numerical solution of problems in science and engineering via the finite element method requires, as a first step, the discretization of a domain into a set of simply shaped elements. Determining the size of these elements along the domain, including the boundary, to form well-shaped elements is a difficult task. We present in this paper a… (More)

- Frederico Paiva Quintão, Alexandre Salles da Cunha, Geraldo Robson Mateus, Abilio Lucena
- Discrete Applied Mathematics
- 2010

- Wagner Moro Aioffi, Cristiano Arbex Valle, Geraldo Robson Mateus, Alexandre Salles da Cunha
- Computer Networks
- 2011

- Cristiano Arbex Valle, Leonardo C. Martinez, Alexandre Salles da Cunha, Geraldo Robson Mateus
- Computers & OR
- 2011

- Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha
- Computers & OR
- 2015

Given a connected and undirected graph, the quadratic minimum spanning tree problem consists of<lb>finding one spanning tree that minimizes a quadratic cost function. We first propose an integer program-<lb>ming formulation based on the reformulation-linearization technique and show that such a formulation<lb>is stronger than previous ones in the… (More)

- Carla Bechelane, Alexandre Salles da Cunha, Geraldo Robson Mateus
- Electronic Notes in Discrete Mathematics
- 2009

A new exact solution algorithm is proposed for the Degree-Constrained Minimum Spanning Tree Problem. The algorithm involves two combined phases. The first one contains a Lagrangian Relaxand-Cut procedure while the second implements a Branch-and-Cut algorithm. Both phases rely on a standard formulation for the problem, reinforced with Blossom Inequalities.… (More)

- Alexandre Salles da Cunha, Abilio Lucena
- Networks
- 2007