#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1996

2018

- This year (3)
- Last 5 years (13)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

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 Rd . Nodes in the B&B tree correspond to full Steiner topologies associated with a subset of… (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… (More)

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

- 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… (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… (More)

- Marcia Fampa
- 2013

We consider a strategic bidding problem under uncertainty in a wholesale energy market, where the economic remuneration of each generator depends on the ability of its own management to submit price… (More)

- SamplingKurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
- 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… (More)

- 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… (More)

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

The clustering problem has an important application in software engineering, which usually deals with large software systems with complex structures. To facilitate the work of software maintainers,… (More)

- 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… (More)