Marcia Fampa

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 34

Top Topics

Cutting Plane Algorithm

Nonlinear Programming

Convex Relaxation

Top Venues

J. Glob. Optim.

Int. Trans. Oper. Res.

Publications

Marcia Fampa, Jon Lee
An outer-approximation algorithm for maximum-entropy sampling. Discret. Appl. Math. 347 (2024)
Yongchun Li, Marcia Fampa, Jon Lee, Feng Qiu, Weijun Xie, Rui Yao
D-Optimal Data Fusion: Exact and Approximation Algorithms. INFORMS J. Comput. 36 (1) (2024)
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Felipe Sinnecker
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location. ISCO (2024)
Gabriel Ponte, Marcia Fampa, Jon Lee
Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem. SEA (2024)
Gabriel Ponte, Marcia Fampa, Jon Lee, Luze Xu
On computing sparse generalized inverses. Oper. Res. Lett. 52 (2024)
Zhongzhu Chen, Marcia Fampa, Jon Lee
Technical Note - Masking Anstreicher's linx Bound for Improved Entropy Bounds. Oper. Res. 72 (2) (2024)
Zhongzhu Chen, Marcia Fampa, Jon Lee
On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem. INFORMS J. Comput. 35 (2) (2023)
Zhongzhu Chen, Marcia Fampa, Jon Lee
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem. ACDA (2023)
Marcia Fampa, Jon Lee
An Outer-Approximation Algorithm for Maximum-Entropy Sampling. ISCO (2022)
Marcia Fampa
Insight into the computation of Steiner minimal trees in Euclidean space of general dimension. Discret. Appl. Math. 308 (2022)
Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp
Two linear approximation algorithms for convex mixed integer nonlinear programming. Ann. Oper. Res. 316 (2) (2022)
Luze Xu, Marcia Fampa, Jon Lee, Gabriel Ponte
Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search. SIAM J. Optim. 31 (3) (2021)
Renan Spencer Trindade, Olinto César Bassi de Araújo, Marcia Fampa
Arc-flow approach for single batch-processing machine scheduling. Comput. Oper. Res. 134 (2021)
Zhongzhu Chen, Marcia Fampa, Amélie Lambert, Jon Lee
Mixing convex-optimization bounds for maximum-entropy sampling. Math. Program. 188 (2) (2021)
Marcia Fampa, Jon Lee, Gabriel Ponte, Luze Xu
Experimental analysis of local searches for sparse reflexive generalized inverses. J. Glob. Optim. 81 (4) (2021)
Christoph Buchheim, Marcia Fampa, Orlando Sarmiento
Lower Bounds for Cubic Optimization over the Sphere. J. Optim. Theory Appl. 188 (3) (2021)
Marcia Fampa, Jon Lee, Gabriel Ponte
Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses. Open J. Math. Optim. 2 (2021)
Marcia Fampa, Jon Lee
Convexification of bilinear forms through non-symmetric lifting. J. Glob. Optim. 80 (2) (2021)
Renan Spencer Trindade, Olinto C. B. de Araújo, Marcia Fampa
Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes. ISCO (2020)
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske
On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. Optim. Lett. 14 (2) (2020)
Marcia Fampa, Jon Lee, Gabriel Ponte
Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses. CoRR (2020)
Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp
An overview of MINLP algorithms and their implementation in Muriqui Optimizer. Ann. Oper. Res. 286 (1) (2020)
Victor K. Fuentes, Marcia Fampa, Jon Lee
Diving for Sparse Partially-Reflexive Generalized Inverses. WCGO (2019)
Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp
Modified Extended Cutting Plane Algorithm for Mixed Integer Nonlinear Programming. WCGO (2019)
Christoph Buchheim, Marcia Fampa, Orlando Sarmiento
Tractable Relaxations for the Cubic One-Spherical Optimization Problem. WCGO (2019)
Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp
Integrality gap minimization heuristics for binary mixed integer nonlinear programming. J. Glob. Optim. 71 (3) (2018)
Marcia Fampa, Francisco Pinillos Nieto
Extensions on ellipsoid bounds for quadratic integer programming. J. Glob. Optim. 71 (3) (2018)
Marcia Fampa, Jon Lee
On sparse reflexive generalized inverse. Oper. Res. Lett. 46 (6) (2018)
Marcia Fampa, Jon Lee
On Sparse Reflexive Generalized Inverses. CoRR (2018)
Marcia Fampa, Jon Lee, Wendel Melo
On global optimization with indefinite quadratics. EURO J. Comput. Optim. 5 (3) (2017)
Marcia Fampa, Wagner Pimentel
Linear programing relaxations for a strategic pricing problem in electricity markets. Int. Trans. Oper. Res. 24 (1-2) (2017)
Marcia Fampa, Jon Lee, Nelson Maculan
-space. Int. Trans. Oper. Res. 23 (5) (2016)
Hugo Harry Kramer, Eduardo Uchoa, Marcia Fampa, Viviane Köhler, François Vanderbeck
Column generation approaches for the software clustering problem. Comput. Optim. Appl. 64 (3) (2016)
Marcia Fampa, Jon Lee, Wendel Melo
-space. Comput. Optim. Appl. 65 (1) (2016)
Marcia Fampa, Wagner Pimentel
An application of genetic algorithm to a bidding problem in electricity markets. Int. Trans. Oper. Res. 22 (1) (2015)
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske
On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space. SEA (2015)
Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp
Integrating nonlinear branch-and-bound and outer approximation for convex Mixed Integer Nonlinear Programming. J. Glob. Optim. 60 (2) (2014)
Viviane Köhler, Marcia Fampa, Olinto C. B. de Araújo
Mixed-Integer Linear Programming Formulations for the Software Clustering Problem. Comput. Optim. Appl. 55 (1) (2013)
Marcia Fampa, Kurt M. Anstreicher
An improved algorithm for computing Steiner minimal trees in Euclidean d-space. Discret. Optim. 5 (2) (2008)
Marcia Fampa, Nelson Maculan
Using a Conic Formulation for Finding Steiner Minimal Trees. Numer. Algorithms 35 (2-4) (2004)
Marcia Fampa, Nelson Maculan
A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ. RAIRO Oper. Res. 35 (4) (2001)
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
Maximum-entropy remote sampling. Discret. Appl. Math. 108 (3) (2001)
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems. Math. Program. 85 (2) (1999)
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
Continuous Relaxations for Constrained Maximum-Entropy Sampling. IPCO (1996)