Continuous Relaxations for Constrained Maximum-Entropy Sampling. - Kurt M. Anstreicher; Marcia Fampa; Jon Lee 001; Joy Williams (IPCO, 1996)

Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems. - Kurt M. Anstreicher; Marcia Fampa; Jon Lee 001; Joy Williams (Math. Program., 1999)

Maximum-entropy remote sampling. - Kurt M. Anstreicher; Marcia Fampa; Jon Lee 001; Joy Williams (Discret. Appl. Math., 2001)

A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ. - Marcia Fampa; Nelson Maculan (RAIRO Oper. Res., 2001)

Market Power Issues in Bid-Based Hydrothermal Dispatch. - Luiz Augusto N. Barroso; Marcia Helena Costa Fampa; Rafael Kelman; Mario V. F. Pereira; Priscila Lino (Ann. Oper. Res., 2002)

Bid-Based Dispatch of Hydrothermal Systems in Competitive Markets. - Priscila Lino; Luiz Augusto N. Barroso; Mario V. F. Pereira; Rafael Kelman; Marcia Helena Costa Fampa (Ann. Oper. Res., 2003)

Using a Conic Formulation for Finding Steiner Minimal Trees. - Marcia Fampa; Nelson Maculan (Numer. Algorithms, 2004)

Optimal grid representations. - Marcia Helena Costa Fampa; Sulamita Klein; Fábio Protti; Debora Cristina Alves Rêgo (Networks, 2004)

An Efficient Heuristic for the Ring Star Problem. - Thayse Christine S. Dias; Gilberto Farias de Sousa Filho; Elder M. Macambira; Lucídio dos Anjos F. Cabral; Marcia Helena Costa Fampa (WEA, 2006)

Bilevel optimization applied to strategic pricing in competitive electricity markets. - Marcia Helena Costa Fampa; Luiz Augusto N. Barroso; D. Candal; Luidi Simonetti (Comput. Optim. Appl., 2008)

An improved algorithm for computing Steiner minimal trees in Euclidean d-space. - Marcia Fampa; Kurt M. Anstreicher (Discret. Optim., 2008)

A stochastic local search algorithm for constrained continuous global optimization. - Wendel A. X. Melo; Marcia H. C. Fampa; Fernanda M. P. Raupp (Int. Trans. Oper. Res., 2012)

Mixed-Integer Linear Programming Formulations for the Software Clustering Problem. - Viviane Köhler; Marcia Fampa; Olinto C. B. de Araújo (Comput. Optim. Appl., 2013)

Semidefinite relaxation for linear programs with equilibrium constraints. - Marcia H. C. Fampa; Wendel A. X. Melo; Nelson Maculan (Int. Trans. Oper. Res., 2013)

Integrating nonlinear branch-and-bound and outer approximation for convex Mixed Integer Nonlinear Programming. - Wendel Melo; Marcia Fampa; Fernanda M. P. Raupp (J. Glob. Optim., 2014)

On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space. - Claudia D'Ambrosio; Marcia Fampa; Jon Lee 001; Stefan Vigerske (SEA, 2015)

An application of genetic algorithm to a bidding problem in electricity markets. - Marcia Fampa; Wagner Pimentel (Int. Trans. Oper. Res., 2015)

A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space. - Marcia Fampa; Jon Lee 001; Wendel Melo (Comput. Optim. Appl., 2016)

Column generation approaches for the software clustering problem. - Hugo Harry Kramer; Eduardo Uchoa; Marcia Fampa; Viviane Köhler; François Vanderbeck (Comput. Optim. Appl., 2016)

An overview of exact algorithms for the Euclidean Steiner tree problem in n-space. - Marcia Fampa; Jon Lee 001; Nelson Maculan (Int. Trans. Oper. Res., 2016)

On global optimization with indefinite quadratics. - Marcia Fampa; Jon Lee 001; Wendel Melo (EURO J. Comput. Optim., 2017)

Linear programing relaxations for a strategic pricing problem in electricity markets. - Marcia Fampa; Wagner Pimentel (Int. Trans. Oper. Res., 2017)

On Sparse Reflexive Generalized Inverses. - Marcia Fampa; Jon Lee 001 (CoRR, 2018)

Modelling and symmetry breaking in scheduling problems on batch processing machines. - Renan Spencer Trindade; Olinto César Bassi de Araújo; Marcia Helena Costa Fampa; Felipe Martins Müller (Int. J. Prod. Res., 2018)

Extensions on ellipsoid bounds for quadratic integer programming. - Marcia Fampa; Francisco Pinillos Nieto (J. Glob. Optim., 2018)

Integrality gap minimization heuristics for binary mixed integer nonlinear programming. - Wendel Melo; Marcia Fampa; Fernanda M. P. Raupp (J. Glob. Optim., 2018)

On sparse reflexive generalized inverse. - Marcia Fampa; Jon Lee 001 (Oper. Res. Lett., 2018)

Tractable Relaxations for the Cubic One-Spherical Optimization Problem. - Christoph Buchheim; Marcia Fampa; Orlando Sarmiento (WCGO, 2019)

Diving for Sparse Partially-Reflexive Generalized Inverses. - Victor K. Fuentes; Marcia Fampa; Jon Lee 001 (WCGO, 2019)

Modified Extended Cutting Plane Algorithm for Mixed Integer Nonlinear Programming. - Wendel Melo; Marcia Fampa; Fernanda M. P. Raupp (WCGO, 2019)

Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes. - Renan Spencer Trindade; Olinto C. B. de Araújo; Marcia Fampa (ISCO, 2020)

An overview of MINLP algorithms and their implementation in Muriqui Optimizer. - Wendel Melo; Marcia Fampa; Fernanda M. P. Raupp (Ann. Oper. Res., 2020)

Parametric convex quadratic relaxation of the quadratic knapsack problem. - Marcia Helena Costa Fampa; Daniela Lubke; Fei Wang 043; Henry Wolkowicz (Eur. J. Oper. Res., 2020)

On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. - Claudia D'Ambrosio; Marcia Fampa; Jon Lee 001; Stefan Vigerske (Optim. Lett., 2020)

Arc-flow approach for single batch-processing machine scheduling. - Renan Spencer Trindade; Olinto César Bassi de Araújo; Marcia Fampa (Comput. Oper. Res., 2021)

Convexification of bilinear forms through non-symmetric lifting. - Marcia Fampa; Jon Lee 001 (J. Glob. Optim., 2021)

Experimental analysis of local searches for sparse reflexive generalized inverses. - Marcia Fampa; Jon Lee 001; Gabriel Ponte; Luze Xu (J. Glob. Optim., 2021)

Lower Bounds for Cubic Optimization over the Sphere. - Christoph Buchheim; Marcia Fampa; Orlando Sarmiento (J. Optim. Theory Appl., 2021)

Mixing convex-optimization bounds for maximum-entropy sampling. - Zhongzhu Chen; Marcia Fampa; Amélie Lambert; Jon Lee 001 (Math. Program., 2021)

Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses. - Marcia Fampa; Jon Lee 001; Gabriel Ponte (Open J. Math. Optim., 2021)

Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search. - Luze Xu; Marcia Fampa; Jon Lee 001; Gabriel Ponte (SIAM J. Optim., 2021)

Two linear approximation algorithms for convex mixed integer nonlinear programming. - Wendel Melo; Marcia Fampa; Fernanda M. P. Raupp (Ann. Oper. Res., 2022)

Insight into the computation of Steiner minimal trees in Euclidean space of general dimension. - Marcia Fampa (Discret. Appl. Math., 2022)

On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem. - Zhongzhu Chen; Marcia Fampa; Jon Lee 001 (INFORMS J. Comput., 2023)

On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location. - Claudia D'Ambrosio; Marcia Fampa; Jon Lee 001; Felipe Sinnecker (ISCO, 2024)

Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem. - Gabriel Ponte; Marcia Fampa; Jon Lee 001 (SEA, 2024)

Computing Experiment-Constrained D-Optimal Designs. - Aditya Pillai; Gabriel Ponte; Marcia Fampa; Jon Lee 001; Mohit Singh; Weijun Xie 001 (CoRR, 2024)

An outer-approximation algorithm for maximum-entropy sampling. - Marcia Fampa; Jon Lee 001 (Discret. Appl. Math., 2024)

D-Optimal Data Fusion: Exact and Approximation Algorithms. - Yongchun Li; Marcia Fampa; Jon Lee 001; Feng Qiu; Weijun Xie 001; Rui Yao (INFORMS J. Comput., 2024)

Technical Note - Masking Anstreicher's linx Bound for Improved Entropy Bounds. - Zhongzhu Chen; Marcia Fampa; Jon Lee 001 (Oper. Res., 2024)

On computing sparse generalized inverses. - Gabriel Ponte; Marcia Fampa; Jon Lee 001; Luze Xu (Oper. Res. Lett., 2024)

Recent Advances in Maximum-Entropy Sampling. - Marcia Fampa; Jon Lee 001 (CoRR, 2025)

Generalized scaling for the constrained maximum-entropy sampling problem. - Zhongzhu Chen; Marcia Fampa; Jon Lee 001 (Math. Program., 2025)