Marcia Fampa

54 papers B 3C 3Journal 43Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Convex relaxation for the generalized maximum-entropy sampling problem.
Algorithmica
Gabriel Ponte, Marcia Fampa, Jon Lee
2026 J jnl
On a geometric graph-covering problem related to optimal safety-landing-site location.
Discret. Appl. Math.
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Felipe Sinnecker
2026 J jnl
The augmented NLP bound for maximum-entropy remote sampling.
CoRR
Gabriel Ponte, Marcia Fampa, Jon Lee
2025 — conf
Computing Experiment-Constrained D-Optimal Designs.
ACDA
Aditya Pillai, Gabriel Ponte, Marcia Fampa, Jon Lee, Mohit Singh, Weijun Xie
2025 J jnl
Generalized scaling for the constrained maximum-entropy sampling problem.
Math. Program.
Zhongzhu Chen, Marcia Fampa, Jon Lee
2025 J jnl
Good and Fast Row-Sparse ah-Symmetric Reflexive Generalized Inverses.
Open J. Math. Optim.
Gabriel Ponte, Marcia Fampa, Jon Lee, Luze Xu
2025 J jnl
Mathematical Optimization Models for the Euclidean Steiner Tree Problem in $\mathbb {R}^d$.
4OR
Nelson Maculan, Marcia Fampa, Hacène Ouzia, Renan Vicente Pinto
2025 J jnl
On the relationship between MESP and 0/1 D-Opt and their upper bounds.
CoRR
Gabriel Ponte, Marcia Fampa, Jon Lee
2025 J jnl
Recent Advances in Maximum-Entropy Sampling.
CoRR
Marcia Fampa, Jon Lee
2024 J jnl
An outer-approximation algorithm for maximum-entropy sampling.
Discret. Appl. Math.
Marcia Fampa, Jon Lee
2024 J jnl
Computing Experiment-Constrained D-Optimal Designs.
CoRR
Aditya Pillai, Gabriel Ponte, Marcia Fampa, Jon Lee, Mohit Singh, Weijun Xie
2024 B conf
Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem.
SEA
Gabriel Ponte, Marcia Fampa, Jon Lee
2024 J jnl
D-Optimal Data Fusion: Exact and Approximation Algorithms.
INFORMS J. Comput.
Yongchun Li, Marcia Fampa, Jon Lee, Feng Qiu, Weijun Xie, Rui Yao
2024 C conf
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location.
ISCO
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Felipe Sinnecker
2024 J jnl
On computing sparse generalized inverses.
Oper. Res. Lett.
Gabriel Ponte, Marcia Fampa, Jon Lee, Luze Xu
2024 J jnl
Technical Note - Masking Anstreicher's linx Bound for Improved Entropy Bounds.
Oper. Res.
Zhongzhu Chen, Marcia Fampa, Jon Lee
2023 — conf
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem.
ACDA
Zhongzhu Chen, Marcia Fampa, Jon Lee
2023 J jnl
On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem.
INFORMS J. Comput.
Zhongzhu Chen, Marcia Fampa, Jon Lee
2022 C conf
An Outer-Approximation Algorithm for Maximum-Entropy Sampling.
ISCO
Marcia Fampa, Jon Lee
2022 J jnl
Insight into the computation of Steiner minimal trees in Euclidean space of general dimension.
Discret. Appl. Math.
Marcia Fampa
2022 J jnl
Two linear approximation algorithms for convex mixed integer nonlinear programming.
Ann. Oper. Res.
Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp
2021 J jnl
Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search.
SIAM J. Optim.
Luze Xu, Marcia Fampa, Jon Lee, Gabriel Ponte
2021 J jnl
Arc-flow approach for single batch-processing machine scheduling.
Comput. Oper. Res.
Renan Spencer Trindade, Olinto César Bassi de Araújo, Marcia Fampa
2021 J jnl
Convexification of bilinear forms through non-symmetric lifting.
J. Glob. Optim.
Marcia Fampa, Jon Lee
2021 J jnl
Experimental analysis of local searches for sparse reflexive generalized inverses.
J. Glob. Optim.
Marcia Fampa, Jon Lee, Gabriel Ponte, Luze Xu
2021 J jnl
Lower Bounds for Cubic Optimization over the Sphere.
J. Optim. Theory Appl.
Christoph Buchheim, Marcia Fampa, Orlando Sarmiento
2021 J jnl
Mixing convex-optimization bounds for maximum-entropy sampling.
Math. Program.
Zhongzhu Chen, Marcia Fampa, Amélie Lambert, Jon Lee
2021 J jnl
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.
Marcia Fampa, Jon Lee, Gabriel Ponte
2020 J jnl
An overview of MINLP algorithms and their implementation in Muriqui Optimizer.
Ann. Oper. Res.
Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp
2020 C conf
Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes.
ISCO
Renan Spencer Trindade, Olinto C. B. de Araújo, Marcia Fampa
2020 J jnl
On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs.
Optim. Lett.
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske
2020 J jnl
Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses.
CoRR
Marcia Fampa, Jon Lee, Gabriel Ponte
2019 — conf
Diving for Sparse Partially-Reflexive Generalized Inverses.
WCGO
Victor K. Fuentes, Marcia Fampa, Jon Lee
2019 — conf
Modified Extended Cutting Plane Algorithm for Mixed Integer Nonlinear Programming.
WCGO
Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp
2019 — conf
Tractable Relaxations for the Cubic One-Spherical Optimization Problem.
WCGO
Christoph Buchheim, Marcia Fampa, Orlando Sarmiento
2018 J jnl
Extensions on ellipsoid bounds for quadratic integer programming.
J. Glob. Optim.
Marcia Fampa, Francisco Pinillos Nieto
2018 J jnl
Integrality gap minimization heuristics for binary mixed integer nonlinear programming.
J. Glob. Optim.
Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp
2018 J jnl
On Sparse Reflexive Generalized Inverses.
CoRR
Marcia Fampa, Jon Lee
2018 J jnl
On sparse reflexive generalized inverse.
Oper. Res. Lett.
Marcia Fampa, Jon Lee
2017 J jnl
Linear programing relaxations for a strategic pricing problem in electricity markets.
Int. Trans. Oper. Res.
Marcia Fampa, Wagner Pimentel
2017 J jnl
On global optimization with indefinite quadratics.
EURO J. Comput. Optim.
Marcia Fampa, Jon Lee, Wendel Melo
2016 J jnl
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in
Comput. Optim. Appl.
Marcia Fampa, Jon Lee, Wendel Melo
2016 J jnl
An overview of exact algorithms for the Euclidean Steiner tree problem in
Int. Trans. Oper. Res.
Marcia Fampa, Jon Lee, Nelson Maculan
2016 J jnl
Column generation approaches for the software clustering problem.
Comput. Optim. Appl.
Hugo Harry Kramer, Eduardo Uchoa, Marcia Fampa, Viviane Köhler, François Vanderbeck
2015 J jnl
An application of genetic algorithm to a bidding problem in electricity markets.
Int. Trans. Oper. Res.
Marcia Fampa, Wagner Pimentel
2015 B conf
On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space.
SEA
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske
2014 J jnl
Integrating nonlinear branch-and-bound and outer approximation for convex Mixed Integer Nonlinear Programming.
J. Glob. Optim.
Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp
2013 J jnl
Mixed-Integer Linear Programming Formulations for the Software Clustering Problem.
Comput. Optim. Appl.
Viviane Köhler, Marcia Fampa, Olinto C. B. de Araújo
2008 J jnl
An improved algorithm for computing Steiner minimal trees in Euclidean d-space.
Discret. Optim.
Marcia Fampa, Kurt M. Anstreicher
2004 J jnl
Using a Conic Formulation for Finding Steiner Minimal Trees.
Numer. Algorithms
Marcia Fampa, Nelson Maculan
2001 J jnl
A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ.
RAIRO Oper. Res.
Marcia Fampa, Nelson Maculan
2001 J jnl
Maximum-entropy remote sampling.
Discret. Appl. Math.
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
1999 J jnl
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems.
Math. Program.
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
1996 B conf
Continuous Relaxations for Constrained Maximum-Entropy Sampling.
IPCO
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams