Marcia Helena Costa Fampa

Orcid: 0000-0002-6254-1510

Affiliations:
  • 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:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On computing sparse generalized inverses.
Oper. Res. Lett., 2024

Technical Note - Masking Anstreicher's linx Bound for Improved Entropy Bounds.
Oper. Res., 2024

D-Optimal Data Fusion: Exact and Approximation Algorithms.
INFORMS J. Comput., 2024

An outer-approximation algorithm for maximum-entropy sampling.
Discret. Appl. Math., 2024

Computing Experiment-Constrained D-Optimal Designs.
CoRR, 2024

Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem.
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
On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem.
INFORMS J. Comput., 2023

Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem.
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

Two linear approximation algorithms for convex mixed integer nonlinear programming.
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

Mixing convex-optimization bounds for maximum-entropy sampling.
Math. Program., 2021

Lower Bounds for Cubic Optimization over the Sphere.
J. Optim. Theory Appl., 2021

Experimental analysis of local searches for sparse reflexive generalized inverses.
J. Glob. Optim., 2021

Convexification of bilinear forms through non-symmetric lifting.
J. Glob. Optim., 2021

Arc-flow approach for single batch-processing machine scheduling.
Comput. Oper. Res., 2021

2020
On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs.
Optim. Lett., 2020

Parametric convex quadratic relaxation of the quadratic knapsack problem.
Eur. J. Oper. Res., 2020

An overview of MINLP algorithms and their implementation in Muriqui Optimizer.
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
Modified Extended Cutting Plane Algorithm for Mixed Integer Nonlinear Programming.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Diving for Sparse Partially-Reflexive Generalized Inverses.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Tractable Relaxations for the Cubic One-Spherical Optimization Problem.
Proceedings of the Optimization of Complex Systems: Theory, 2019

2018
On sparse reflexive generalized inverse.
Oper. Res. Lett., 2018

Integrality gap minimization heuristics for binary mixed integer nonlinear programming.
J. Glob. Optim., 2018

Extensions on ellipsoid bounds for quadratic integer programming.
J. Glob. Optim., 2018

Modelling and symmetry breaking in scheduling problems on batch processing machines.
Int. J. Prod. Res., 2018

On Sparse Reflexive Generalized Inverses.
CoRR, 2018

2017
Linear programing relaxations for a strategic pricing problem in electricity markets.
Int. Trans. Oper. Res., 2017

On global optimization with indefinite quadratics.
EURO J. Comput. Optim., 2017

2016
An overview of exact algorithms for the Euclidean Steiner tree problem in <i>n</i>-space.
Int. Trans. Oper. Res., 2016

Column generation approaches for the software clustering problem.
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
An application of genetic algorithm to a bidding problem in electricity markets.
Int. Trans. Oper. Res., 2015

On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space.
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
Semidefinite relaxation for linear programs with equilibrium constraints.
Int. Trans. Oper. Res., 2013

Mixed-Integer Linear Programming Formulations for the Software Clustering Problem.
Comput. Optim. Appl., 2013

2012
A stochastic local search algorithm for constrained continuous global optimization.
Int. Trans. Oper. Res., 2012

2008
An improved algorithm for computing Steiner minimal trees in Euclidean d-space.
Discret. Optim., 2008

Bilevel optimization applied to strategic pricing in competitive electricity markets.
Comput. Optim. Appl., 2008

2006
An Efficient Heuristic for the Ring Star Problem.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2004
Optimal grid representations.
Networks, 2004

Using a Conic Formulation for Finding Steiner Minimal Trees.
Numer. Algorithms, 2004

2003
Bid-Based Dispatch of Hydrothermal Systems in Competitive Markets.
Ann. Oper. Res., 2003

2002
Market Power Issues in Bid-Based Hydrothermal Dispatch.
Ann. Oper. Res., 2002

2001
A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ.
RAIRO Oper. Res., 2001

Maximum-entropy remote sampling.
Discret. Appl. Math., 2001

1999
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems.
Math. Program., 1999

1996
Continuous Relaxations for Constrained Maximum-Entropy Sampling.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996


  Loading...