Marcia Helena Costa Fampa
Orcid: 0000-0002-6254-1510Affiliations:
- Universidade Federal do Rio de Janeiro, Brasil
According to our database1,
Marcia Helena Costa Fampa
authored at least 52 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Oper. Res., 2024
Discret. Appl. Math., 2024
Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location.
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024
2023
INFORMS J. Comput., 2023
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023
2022
Insight into the computation of Steiner minimal trees in Euclidean space of general dimension.
Discret. Appl. Math., 2022
Ann. Oper. Res., 2022
2021
Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search.
SIAM J. Optim., 2021
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., 2021
J. Glob. Optim., 2021
J. Glob. Optim., 2021
Comput. Oper. Res., 2021
2020
On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs.
Optim. Lett., 2020
Eur. J. Oper. Res., 2020
Ann. Oper. Res., 2020
Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020
2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
2018
Integrality gap minimization heuristics for binary mixed integer nonlinear programming.
J. Glob. Optim., 2018
J. Glob. Optim., 2018
Int. J. Prod. Res., 2018
2017
Linear programing relaxations for a strategic pricing problem in electricity markets.
Int. Trans. Oper. Res., 2017
2016
An overview of exact algorithms for the Euclidean Steiner tree problem in <i>n</i>-space.
Int. Trans. Oper. Res., 2016
Comput. Optim. Appl., 2016
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in <i>n</i>-space.
Comput. Optim. Appl., 2016
2015
Int. Trans. Oper. Res., 2015
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015
2014
Integrating nonlinear branch-and-bound and outer approximation for convex Mixed Integer Nonlinear Programming.
J. Glob. Optim., 2014
2013
Int. Trans. Oper. Res., 2013
Comput. Optim. Appl., 2013
2012
Int. Trans. Oper. Res., 2012
2008
Discret. Optim., 2008
Bilevel optimization applied to strategic pricing in competitive electricity markets.
Comput. Optim. Appl., 2008
2006
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006
2004
2003
Ann. Oper. Res., 2003
2002
2001
RAIRO Oper. Res., 2001
1999
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems.
Math. Program., 1999
1996
Proceedings of the Integer Programming and Combinatorial Optimization, 1996