#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1996

2017

- This year (2)
- Last 5 years (10)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn 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)

- 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. 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
- Discrete Applied Mathematics
- 2001

We consider the “remote-sampling” problem of choosing a subset S, with |S|= 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 con ne our attention to the case in… (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)

- Marcia Fampa, Nelson Maculan
- Numerical Algorithms
- 2004

We present a new mathematical programming formulation for the Steiner minimal tree problem. We relax the integrality constraints on this formulation and transform the resulting problem (which is convex, but not everywhere differentiable) into a standard convex programming problem in conic form. We consider an efficient computation of an ε-optimal solution… (More)

- Viviane Köhler, Marcia Fampa, Olinto Araújo
- Comp. Opt. and Appl.
- 2013

- Hugo Harry Kramer, Eduardo Uchoa, Marcia Fampa, Viviane Köhler, François Vanderbeck
- Comp. Opt. and Appl.
- 2016

This work presents the application of branch-and-price approaches to the automatic version of the Software Clustering Problem. To tackle this problem, we apply the Dantzig–Wolfe decomposition to a formulation from the literature. Given this, we present two Column Generation (CG) approaches to solve the linear programming relaxation of the resulting… (More)

- 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)