Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcia Helena Costa Fampa
Person information
- affiliation: Universidade Federal do Rio de Janeiro, Brasil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j40]Marcia Fampa, Jon Lee
:
An outer-approximation algorithm for maximum-entropy sampling. Discret. Appl. Math. 347: 271-284 (2024)- [j39]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): 97-120 (2024) - [j38]Zhongzhu Chen, Marcia Fampa, Jon Lee:
Technical Note - Masking Anstreicher's linx Bound for Improved Entropy Bounds. Oper. Res. 72(2): 591-603 (2024) - [j37]Gabriel Ponte, Marcia Fampa, Jon Lee, Luze Xu:
On computing sparse generalized inverses. Oper. Res. Lett. 52: 107058 (2024) - 2023
- [j36]Zhongzhu Chen, Marcia Fampa, Jon Lee:
On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem. INFORMS J. Comput. 35(2): 368-385 (2023) - 2022
- [j35]Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp:
Two linear approximation algorithms for convex mixed integer nonlinear programming. Ann. Oper. Res. 316(2): 1471-1491 (2022) - [j34]Marcia Fampa:
Insight into the computation of Steiner minimal trees in Euclidean space of general dimension. Discret. Appl. Math. 308: 4-19 (2022) - 2021
- [j33]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: 105394 (2021) - [j32]Marcia Fampa, Jon Lee:
Convexification of bilinear forms through non-symmetric lifting. J. Glob. Optim. 80(2): 287-305 (2021) - [j31]Marcia Fampa, Jon Lee, Gabriel Ponte, Luze Xu:
Experimental analysis of local searches for sparse reflexive generalized inverses. J. Glob. Optim. 81(4): 1057-1093 (2021) - [j30]Christoph Buchheim, Marcia Fampa, Orlando Sarmiento:
Lower Bounds for Cubic Optimization over the Sphere. J. Optim. Theory Appl. 188(3): 823-846 (2021) - [j29]Zhongzhu Chen, Marcia Fampa, Amélie Lambert, Jon Lee:
Mixing convex-optimization bounds for maximum-entropy sampling. Math. Program. 188(2): 539-568 (2021) - [j28]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: 1-14 (2021) - [j27]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): 1722-1747 (2021) - 2020
- [j26]Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp:
An overview of MINLP algorithms and their implementation in Muriqui Optimizer. Ann. Oper. Res. 286(1): 217-241 (2020) - [j25]Marcia Helena Costa Fampa, D. Lubke, Fei Wang, Henry Wolkowicz:
Parametric convex quadratic relaxation of the quadratic knapsack problem. Eur. J. Oper. Res. 281(1): 36-49 (2020) - [j24]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): 409-415 (2020) - 2018
- [j23]Renan Spencer Trindade, Olinto César Bassi de Araújo, Marcia Helena Costa Fampa, Felipe Martins Müller:
Modelling and symmetry breaking in scheduling problems on batch processing machines. Int. J. Prod. Res. 56(22): 7031-7048 (2018) - [j22]Marcia Fampa, Francisco Pinillos Nieto:
Extensions on ellipsoid bounds for quadratic integer programming. J. Glob. Optim. 71(3): 457-482 (2018) - [j21]Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp:
Integrality gap minimization heuristics for binary mixed integer nonlinear programming. J. Glob. Optim. 71(3): 593-612 (2018) - [j20]Marcia Fampa, Jon Lee:
On sparse reflexive generalized inverse. Oper. Res. Lett. 46(6): 605-610 (2018) - 2017
- [j19]Marcia Fampa, Jon Lee, Wendel Melo:
On global optimization with indefinite quadratics. EURO J. Comput. Optim. 5(3): 309-337 (2017) - [j18]Marcia Fampa, Wagner Pimentel:
Linear programing relaxations for a strategic pricing problem in electricity markets. Int. Trans. Oper. Res. 24(1-2): 159-172 (2017) - 2016
- [j17]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): 843-864 (2016) - [j16]Marcia Fampa, Jon Lee, Wendel Melo:
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space. Comput. Optim. Appl. 65(1): 47-71 (2016) - [j15]Marcia Fampa, Jon Lee, Nelson Maculan:
An overview of exact algorithms for the Euclidean Steiner tree problem in n-space. Int. Trans. Oper. Res. 23(5): 861-874 (2016) - 2015
- [j14]Marcia Fampa, Wagner Pimentel:
An application of genetic algorithm to a bidding problem in electricity markets. Int. Trans. Oper. Res. 22(1): 97-111 (2015) - 2014
- [j13]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): 373-389 (2014) - 2013
- [j12]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): 113-135 (2013) - [j11]Marcia H. C. Fampa, Wendel A. X. Melo, Nelson Maculan:
Semidefinite relaxation for linear programs with equilibrium constraints. Int. Trans. Oper. Res. 20(2): 201-212 (2013) - 2012
- [j10]Wendel A. X. Melo, Marcia H. C. Fampa, Fernanda M. P. Raupp:
A stochastic local search algorithm for constrained continuous global optimization. Int. Trans. Oper. Res. 19(6): 825-846 (2012) - 2008
- [j9]Marcia Helena Costa Fampa, Luiz Augusto N. Barroso, D. Candal, Luidi Simonetti:
Bilevel optimization applied to strategic pricing in competitive electricity markets. Comput. Optim. Appl. 39(2): 121-142 (2008) - [j8]Marcia Fampa, Kurt M. Anstreicher:
An improved algorithm for computing Steiner minimal trees in Euclidean d-space. Discret. Optim. 5(2): 530-540 (2008) - 2004
- [j7]Marcia Fampa, Nelson Maculan:
Using a Conic Formulation for Finding Steiner Minimal Trees. Numer. Algorithms 35(2-4): 315-330 (2004) - [j6]Marcia Helena Costa Fampa, Sulamita Klein, Fábio Protti, Debora Cristina Alves Rêgo:
Optimal grid representations. Networks 44(3): 187-193 (2004) - 2003
- [j5]Priscila Lino, Luiz Augusto N. Barroso, Mario V. F. Pereira, Rafael Kelman, Marcia Helena Costa Fampa:
Bid-Based Dispatch of Hydrothermal Systems in Competitive Markets. Ann. Oper. Res. 120(1-4): 81-97 (2003) - 2002
- [j4]Luiz Augusto N. Barroso, Marcia Helena Costa Fampa, Rafael Kelman, Mario V. F. Pereira, Priscila Lino:
Market Power Issues in Bid-Based Hydrothermal Dispatch. Ann. Oper. Res. 117(1-4): 247-270 (2002) - 2001
- [j3]Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams:
Maximum-entropy remote sampling. Discret. Appl. Math. 108(3): 211-226 (2001) - [j2]Marcia Fampa, Nelson Maculan:
A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ. RAIRO Oper. Res. 35(4): 383-394 (2001) - 1999
- [j1]Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams:
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems. Math. Program. 85(2): 221-240 (1999)
Conference and Workshop Papers
- 2024
- [c11]Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Felipe Sinnecker:
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location. ISCO 2024: 16-29 - [c10]Gabriel Ponte, Marcia Fampa, Jon Lee:
Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem. SEA 2024: 25:1-25:14 - 2023
- [c9]Zhongzhu Chen, Marcia Fampa, Jon Lee:
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem. ACDA 2023: 110-118 - 2022
- [c8]Marcia Fampa, Jon Lee:
An Outer-Approximation Algorithm for Maximum-Entropy Sampling. ISCO 2022: 130-142 - 2020
- [c7]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: 179-190 - 2019
- [c6]Victor K. Fuentes, Marcia Fampa, Jon Lee:
Diving for Sparse Partially-Reflexive Generalized Inverses. WCGO 2019: 89-98 - [c5]Christoph Buchheim, Marcia Fampa, Orlando Sarmiento:
Tractable Relaxations for the Cubic One-Spherical Optimization Problem. WCGO 2019: 267-276 - [c4]Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp:
Modified Extended Cutting Plane Algorithm for Mixed Integer Nonlinear Programming. WCGO 2019: 428-437 - 2015
- [c3]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: 122-133 - 2006
- [c2]Thayse Christine S. Dias, Gilberto Farias de Sousa Filho, Elder M. Macambira, Lucídio dos Anjos F. Cabral, Marcia Helena Costa Fampa:
An Efficient Heuristic for the Ring Star Problem. WEA 2006: 24-35 - 1996
- [c1]Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams:
Continuous Relaxations for Constrained Maximum-Entropy Sampling. IPCO 1996: 234-248
Informal and Other Publications
- 2020
- [i2]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 abs/2011.02509 (2020) - 2018
- [i1]Marcia Fampa, Jon Lee:
On Sparse Reflexive Generalized Inverses. CoRR abs/1807.03074 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-15 03:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
