Marcia Helena Costa Fampa
Instituição:
Universidade Federal do Rio de Janeiro
Centro:
Centro de Ciências Matemáticas e da Natureza
Unidade:
Instituto de Matemática
Departamento:
Departamento de Ciência da Computação/I Mat
Formação:
-
University of Iowa
| Pós-Doutorado | 2005 - 2006
-
Universidade Federal do Rio de Janeiro
Engenharia de Sistemas e Computação | Doutorado | 1993 - 1996
-
Universidade Federal do Rio de Janeiro
Engenharia de Sistemas e Computação | Mestrado | 1989 - 1992
-
Pontifícia Universidade Católica do Rio de Janeiro
Engenharia Elétrica | Graduação | 1983 - 1987
Laboratórios:
Nenhum laboratório cadastrado
Nuvens de Palavras:
Artigos:
(95.65% artigos com DOI)
| Titulo | DOI | Ano |
|---|---|---|
| On computing sparse generalized inverses | 10.1016/j.orl.2023.107058 | 2024 |
| An outer-approximation algorithm for maximum-entropy sampling | 10.1016/j.dam.2024.01.002 | 2024 |
| On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem | 10.1287/ijoc.2022.1264 | 2023 |
| D-Optimal Data Fusion: Exact and Approximation Algorithms | 10.1287/ijoc.2022.0235 | 2023 |
| Insight into the computation of Steiner minimal trees in Euclidean space of general dimension | 10.1016/j.dam.2019.03.015 | 2022 |
| Technical Note-Masking Anstreicher?s linx Bound for Improved Entropy Bounds | 10.1287/opre.2022.2324 | 2022 |
| Convexification of bilinear forms through non-symmetric lifting | 10.1007/s10898-020-00975-z | 2021 |
| Lower Bounds for Cubic Optimization over the Sphere | 10.1007/s10957-021-01809-y | 2021 |
| Approximate 1-norm minimization and minimum-rank structured sparsity for various generalized inverses via local search | 10.1137/19M1281514 | 2021 |
| Trading off 1-norm and sparsity against rank for linear models using mathematical optimization | 10.5802/ojmo.6 | 2021 |
| Arc-flow approach for single batch-processing machine scheduling | 10.1016/j.cor.2021.105394 | 2021 |
| Experimental analysis of local searches for sparse reflexive generalized inverses | 10.1007/s10898-021-01087-y | 2021 |
| Mixing convex-optimization bounds for maximum-entropy sampling | 10.1007/s10107-020-01588-w | 2021 |
| Two linear approximation algorithms for convex mixed integer nonlinear programming | 10.1007/s10479-020-03722-5 | 2020 |
| On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs | 10.1007/s11590-018-1295-1 | 2020 |
| Parametric Convex Quadratic Relaxation of the Quadratic Knapsack Problem | 10.1016/j.ejor.2019.08.027 | 2019 |
| An overview of MINLP algorithms and their implementation in Muriqui Optimizer | 10.1007/s10479-018-2872-5 | 2018 |
| Integrality gap minimization heuristics for binary mixed integer nonlinear programming | 10.1007/s10898-018-0623-4 | 2018 |
| Modelling and symmetry breaking in scheduling problems on batch processing machines | 10.1080/00207543.2018.1424371 | 2018 |
| On sparse reflexive generalized inverse | 10.1016/j.orl.2018.09.005 | 2018 |
| Extensions on ellipsoid bounds for quadratic integer programming | 10.1007/s10898-017-0557-2 | 2017 |
| Column generation approaches for the software clustering problem | 10.1007/s10589-015-9822-9 | 2016 |
| A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space | 10.1007/s10589-016-9835-z | 2016 |
| On global optimization with indefinite quadratics | 10.1007/s13675-016-0079-6 | 2016 |
| Linear programing relaxations for a strategic pricing problem in electricity markets | 10.1111/itor.12293 | 2016 |
| An application of genetic algorithm to a bidding problem in electricity markets | 10.1111/itor.12075 | 2015 |
| An overview of exact algorithms for the Euclidean Steiner tree problem in n -space | 10.1111/itor.12207 | 2015 |
| Integrating nonlinear branch-and-bound and outer approximation for convex Mixed Integer Nonlinear Programming | 10.1007/s10898-014-0217-8 | 2014 |
| Semidefinite relaxation for linear programs with equilibrium constraints | 10.1111/j.1475-3995.2012.00869.x | 2013 |
| Mixed-Integer Linear Programming Formulations for the Software Clustering Problem | 10.1007/s10589-012-9512-9 | 2013 |
| Decomposition approach for generation and transmission expansion planning with implicit multipliers evaluation | 10.1590/S0101-74382013005000010 | 2013 |
| A stochastic local search algorithm for constrained continuous global optimization | 10.1111/j.1475-3995.2012.00854.x | 2012 |
| Metaheurística Busca Tabu e programação matemática: uma abordagem híbrida aplicada ao problema de programação de tripulações | 2009 | |
| Bilevel optimization applied to strategic pricing in competitive electricity markets | 10.1007/s10589-007-9066-4 | 2008 |
| An improved algorithm for computing Steiner minimal trees in Euclidean d-space | 10.1016/j.disopt.2007.08.006 | 2008 |
| Nash Equilibrium in Strategic Bidding: A Binary Expansion Approach | 10.1109/TPWRS.2006.873127 | 2006 |
| Strategic Bidding Under Uncertainty: A Binary Expansion Approach | 10.1109/TPWRS.2004.840397 | 2005 |
| Using a Conic Formulation for Finding Steiner Minimal Trees | 10.1023/B:NUMA.0000021765.17831.bc | 2004 |
| Optimal grid representations | 10.1002/net.20032 | 2004 |
| Planejamento de Anéis Unidirecionais em Telecomunicações: uma Aplicação do Método GRASP | 10.5540/tema.2004.05.02.0227 | 2004 |
| Bid-Based Dispatch of Hydrothermal Systems in Competitive Markets | 10.1023/A:1023322328294 | 2003 |
| Market Power Issues in Bid-Based Hydrothermal Dispatch | 10.1023/A:1021537910823 | 2002 |
| Maximum-entropy remote sampling | 10.1016/S0166-218X(00)00217-1 | 2001 |
| A New Relaxation in Conic Form for the Euclidean Steiner Problem in - | 10.1051/ro:2001120 | 2001 |
| Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems | 10.1007/s101070050055 | 1999 |
| Uma Heurística Para O Problema de Configuração de Explotacção de Campos Submarinos de Petróleo | 1995 |
Eventos:
(2.83% eventos com DOI)
| Titulo | DOI | Ano |
|---|---|---|
| Branch-and-bound for D-Optimality with fast local search and variable-bound tightening | 10.4171/OWR/2023/35 | 2023 |
| Otimização de dimensionamento de lotes com dependência entre as variáveis demanda e preço | 2022 | |
| Exact and heuristic solution approaches for the D-Optimality problem | 2022 | |
| O método ADMM para um problema de otimização polinomial não convexo | 10.5540/03.2022.009.01.0281 | 2022 |
| Modeling demand-price dependence in lot-sizing optimization | 2022 | |
| ARREDONDAMENTO ESTOCÁSTICO ESTRUTURADO PARA PROGRAMAÇÃO INTEIRA 0-1 MISTA | 2021 | |
| Um algoritmo de branch-and-bound baseado em programação linear para programação não linear inteira mista convexa | 2018 | |
| An arc-flow formulation for minimizing makespan on a single batch processing machine and non-identical job sizes | 2018 | |
| Extending cover inequalities for the quadratic knapsack problem to relaxations in lifted space | 2018 | |
| Un Algoritmo para Programación No Lineal Entera Mixta Convexa Basado en Plan de Corte Extendido | 2018 | |
| Minimizing the makespan on parallel machines with sequence dependent deteriorating effects | 2017 | |
| Rank-Sparsity Decomposition of a Positive Semidefinite Matrix | 2017 | |
| Relaxações lineares eficientes para problemas de otimização polinomial | 2017 | |
| Algoritmo de Plano de Corte Estendido Modificado para Programação Não Linear Inteira Mista | 2017 | |
| Generalization of Ellipsoid bounds for Nonconvex Quadratic Integer Problems | 2016 | |
| Modeling the Euclidean Steiner Tree Problem | 2016 | |
| Extensions on Ellipsoid Bounds for Quadratic Programs | 2016 | |
| An Integrality Gap Minimization Heuristic for Binary Mixed Integer Nonlinear Programming | 2016 | |
| MILP Model for Batch Scheduling on Parallel Machines | 2016 | |
| Sparse pseudoinverses via LP and SDP relaxations of Moore-Penrose | 2016 | |
| Modeling symmetry cuts for batch scheduling with realease times and non-identical job sizes | 2016 | |
| Computing leastcore allocations for firm-energy rights: A Mixed Integer Programming procedure | 10.1109/PESGM.2016.7741973 | 2016 |
| A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space | 2015 | |
| Upper bounds for the binary quadratic knapsack problem | 2015 | |
| Um novo algoritmo de minimização de gap para Programação Não Linear Inteira Mista binária | 2015 | |
| Global Optimization with Non-Convex Quadratics | 2014 | |
| A cutting plane algorithm for bounding a strategic pricing problem in electricity markets | 2014 | |
| A new mixed integer linear programming model for minimizing makespan on a single batch processing machine with release times and non-identical job sizes | 2014 | |
| COLUMN GENERATION APPROACHES FOR THE SOFTWARE CLUSTERING PROBLEM | 2014 | |
| A cutting plane algorithm for bounding a strategic pricing problem in electricity markets | 2014 | |
| Solving single batch processing machine problem using symmetry-breaking constraints | 2014 | |
| Solving Euclidean Steiner Tree Problems in n-space | 2014 | |
| Representation of non-convexities in stochastic dual dynamic programming applied to hydrothermal operation problems | 2013 | |
| Stochastic Dual Programming with CVaR Risk Constraints Applied to Hydrothermal Scheduling | 2013 | |
| Método de geração de colunas para o problema de dimensionamento e programação de lotes em máquina única | 2013 | |
| SDP relaxation for a strategic pricing bilevel problem in electricity markets | 2013 | |
| A Bilevel Model and Solution Approaches for a Strategic Bidding Problem in Electricity Markets | 2013 | |
| An Integrality Gap Minimization Algorithm for Binary Mixed Integer Nonlinear Programming | 2013 | |
| MINLP Formulations for the Euclidean Steiner Problem | 2013 | |
| Mathematical Programming Formulations for the Clustering Problem with application in Software Engineering | 2012 | |
| MILP formulation for the software clustering pproblem | 2012 | |
| A new hybrid algorithm between branch-and-bound and outer approximation to mixed integer nonlinear programming | 2012 | |
| Uma heurística de minimização de gap para Programação Não Linear Inteira Mista com variáveis binárias | 2012 | |
| A Genetic Algorithm to the Strategic Pricing Problem in Competitive Electricity Markets | 2012 | |
| Um modelo de otimização para o problema de dimensionamento e programação de lotes de produção em máquina única | 2012 | |
| MILP formulation for the software clustering problem | 2012 | |
| Representation of Nonconvexities in Stochastic Dual Dynamic Programming (SDDP) | 2012 | |
| Stochastic Dual Dynamic Programming with CVaR Risk Constraints Applied to Hydrothermal Scheduling | 2012 | |
| A Genetic Algorithmto the Strategic Pricing Problemin Competitive Electricity Markets | 2012 | |
| An Algorithm Based on Iterated Local Search for the Crew Scheduling Problem | 2010 | |
| Evolução Diferencial Aperfeiçoada para otimização contínua restrita | 2010 | |
| UTILIZAÇÃO DE METAHEURÍSTICAS ILS E VND PARA RESOLVER O PROBLEMA DE CLUSTERIZAÇÃO EM GRAFOS ORIENTADOS | 2010 | |
| Probabilistic and MIP Procedures Applied to the Computation of Core Allocation of Firm Energy Rights | 2010 | |
| Computing core allocations for firm-energy rights: a MIP and a randomized procedures | 2010 | |
| Decomposition Approach for G-T Expansion Planning with Implicit Multipliers Evaluation | 2010 | |
| Allocation of firm-energy rights among hydro agents | 2009 | |
| Computing core allocations for firm energy rights: a MIP and a randomized procedures | 2009 | |
| A branch-and-cut algorithm for the min-span frequency assignment problem | 2009 | |
| Busca Local Intensiva: Uma nova metaheurística para otimização global contínua restrita | 2009 | |
| Considering Reliability Constraints in the Power Systems Expansion | 2009 | |
| Decomposition technique with implicit multipliers evaluation in electrical expansion planning | 2009 | |
| Técnica de decomposição com o cálculo de multiplicadores implícitos no planejamento da expansão de sistemas elétricos | 2008 | |
| Incorporação de Restrições de Confiabilidade ao Problema de Planejamento Ótimo da Expansão de Sistemas Elétricos | 2008 | |
| Semidefinite Relaxation and branch-and-bound algorithm for LPECs | 2008 | |
| Metaheurística Busca Tabu e Programação Matemática: Uma abordagem híbrida aplicada ao problema de programação de tripulações | 2008 | |
| A Branch-and-bound Algorithm for LPECs | 2008 | |
| Computing Steiner minimal trees in Euclidean d-space | 2007 | |
| A semidefinite-based branch-and-bound algorithm for the bilevel programming problem | 2006 | |
| An improved algorithm for computing Steiner minimal trees in Euclidean d-space | 2006 | |
| A hybrid metaheuristic for the ring star problem | 2006 | |
| PROGRAMAÇÃO DA PRODUÇÃO DE GASOLINA EM REFINARIA: MODELAGEM MATEMÁTICA E UM ALGORITMO DE SOLUÇÃO | 2005 | |
| The computation of Steiner minimal trees in euclidean d-space | 2005 | |
| An improved algorithm for computing Steiner minimal tress in R^d | 2005 | |
| Strategic pricing in competitive electricity markets | 2004 | |
| Modeling and solving the stochastic taxation problem | 2004 | |
| A Second Order Cone Programming Relaxation for theSteiner Minimal Tree Problem | 2004 | |
| Programação em dois níveis: uma aplicação ao mercado de energia | 2003 | |
| A bilevel model and solution algorithm for the stochastic taxation problem | 2003 | |
| Otimização Aplicada ao Planejamento de Anéis Unidirecionais em Telecomunicações | 2003 | |
| Programação em dois níveis: Uma aplicação ao mercado de energia | 2002 | |
| Strategic Pricing in Thermal Systems | 2001 | |
| Programação semidefinida positiva aplicada ao problema de topologia de treliças | 2001 | |
| A New Relaxation in Conic Form for the Euclidean Steiner Problem | 2001 | |
| Programação Semidefinida aplic. ao probl. de topologia de treliças | 2001 | |
| Um modelo de programação bilinear em dois níveis e algoritmos de solução para o problema de despacho de energia elétrica | 2001 | |
| Otimização Aplicada ao Planejamento de Anéis Síncronos em Telecomunicações | 2001 | |
| Operação Descentralizada de Sistemas Hodrotérmicos em Ambiente de Mercado | 2001 | |
| An Efficiently Solvable Relaxation for the Euclidean Steiner Tree Problem | 2000 | |
| A linear programming approach for chordal completion | 2000 | |
| Programação linear aplicada à resolução de sistemas lineares esparsos | 2000 | |
| Aplicação do Problema de dois níveis a um problema de despacho de energia elétrica | 2000 | |
| Programação Semidefinida Positiva aplicada a problemas de otimização estrutural | 2000 | |
| Market Power Issues in Bid-Based Hydrotermal Dispatch | 2000 | |
| Une Nouvelle Relaxation sous forme conique du problème euclidien dans Rn | 1999 | |
| Obtenção de Limites Inferiores para o Problema de Steiner em Rn através da Solução de um Problema Cônico | 1999 | |
| A New Relaxation in Conic Form for the Euclidean Steiner Problem in Rn | 1999 | |
| Minimizing A Sum Of Euclidean Norms | 1998 | |
| Solving Remote Sampling Problems Using Continuous Nonlinear Relaxations | 1998 | |
| Solução do Problema da Amostra de Máxima Entropia | 1998 | |
| Maximum-Entropy Remote Sampling | 1998 | |
| Convergence Rate, Implementation Issues And Numerical Results Of A Long-Step Path Following Algorithm For Semidefinite Programming | 1997 | |
| Continuous Nonlinear relaxation for maximum-entropy sampling and related problems | 1997 | |
| A Branch-And-Bound Algorithm For The Problem Of Choosing A Principal Submatrix With Maximal Determinant From A Positive Definite Matrix Subject To Linear Constrains | 1996 | |
| Continuous Relaxations For Constrained Maximum Entropy Sampling | 1996 | |
| Continuous Relaxations for constrained maximum-entropy sampling | 1996 | |
| Continuous relaxations for constrained maximum-entropy sampling | 1996 |