#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1996

2017

- This year (1)
- Last five years (10)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Marcia Fampa, Kurt M. Anstreicher
- Discrete Optimization
- 2008

We describe improvements to Smith's branch-and-bound (B&B) algorithm for the Euclidean Steiner problem in IR d. Nodes in the B&B tree correspond to full Steiner topologies associated with a subset of the terminal nodes, and branching is accomplished by " merging " a new terminal node with each edge in the current Steiner tree. For a given topology we use a… (More)

- Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
- Math. Program.
- 1999

We consider a new nonlinear relaxation for the Constrained Maximum-Entropy Sampling Problem { the problem of choosing the s s principal submatrix with maximal determinant from a given n n positive deenite matrix, subject to linear constraints. We implement a branch-and-bound algorithm for the problem, using the new relaxation. The performance on test… (More)

- Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
- IPCO
- 1996

We consider a new nonlinear relaxation for the Constrained Maximum Entropy Sampling Problem { the problem of choosing the s s principal submatrix with maximal determinant from a given n n positive deenite matrix, subject to linear constraints. We implement a branch-and-bound algorithm for the problem, using the new relaxation. The performance on test… (More)

- Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
- Discrete Applied Mathematics
- 2001

We consider the \remote{sampling" problem of choosing a subset S, with jSj = s, from a set N of observable random variables so as to obtain as much information as possible about a set T of target random variables which are not directly observable. Our criterion is that of minimizing the entropy of T conditioned on S. We connne our attention to the case in… (More)

- Marcia Fampa, Nelson Maculan
- Numerical Algorithms
- 2004

- Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp
- J. Global Optimization
- 2014

- Marcia Fampa, Nelson Maculan
- RAIRO - Operations Research
- 2001

- Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske
- SEA
- 2015

The Euclidean Steiner Tree Problem in dimension greater than 2 is notoriously difficult. Successful methods for exact solution are not based on mathematical-optimization — rather, they involve very sophisticated enumeration. There are two types of mathematical-optimization formulations in the literature, and it is an understatement to say that neither… (More)

- Marcia Fampa, Wagner Pimentel
- ITOR
- 2015

- Marcia Fampa, Jon Lee, Nelson Maculan
- ITOR
- 2016