Marcia Fampa
Marcia Fampa
Email verificata su - Home page
TitoloCitata daAnno
Strategic bidding under uncertainty: a binary expansion approach
MV Pereira, S Granville, MHC Fampa, R Dix, LA Barroso
IEEE Transactions on Power Systems 20 (1), 180-188, 2005
Nash equilibrium in strategic bidding: A binary expansion approach
LA Barroso, RD Carneiro, S Granville, MV Pereira, MHC Fampa
IEEE Transactions on Power systems 21 (2), 629-638, 2006
Bilevel optimization applied to strategic pricing in competitive electricity markets
M Fampa, LA Barroso, D Candal, L Simonetti
Computational Optimization and Applications 39 (2), 121-142, 2008
Bid-based dispatch of hydrothermal systems in competitive markets
P Lino, LAN Barroso, MVF Pereira, R Kelman, MHC Fampa
Annals of Operations Research 120 (1-4), 81-97, 2003
OtimizašŃo linear
N Maculan, MHC Fampa
Editora UNB, 1a edišŃo, 2006
An improved algorithm for computing Steiner minimal trees in Euclidean d-space
M Fampa, KM Anstreicher
Discrete Optimization 5 (2), 530-540, 2008
A long-step path following algorithm for semidefinite programming problems
KM Anstreicher, M Fampa
Topics in Semidefinite and Interior-Point Methods 18, 181-196, 1998
An efficient heuristic for the ring star problem
TCS Dias, GF de Sousa Filho, EM Macambira, FC Lucidio dos Anjos, ...
International Workshop on Experimental and Efficient Algorithms, 24-35, 2006
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems
KM Anstreicher, M Fampa, J Lee, J Williams
Mathematical Programming 85 (2), 221-240, 1999
Market power issues in bid-based hydrothermal dispatch
LAN Barroso, MHC Fampa, R Kelman, MVF Pereira, P Lino
Annals of Operations Research 117 (1-4), 247-270, 2002
Continuous relaxations for constrained maximum-entropy sampling
KM Anstreicher, M Fampa, J Lee, J Williams
International Conference on Integer Programming and Combinatorialá…, 1996
Non-convexities representation on hydrothermal operation planning using sddp
F Thome, M Pereira, S Granville, M Fampa
URL: www. psr-inc. com, submitted, 2013
Using a conic formulation for finding Steiner minimal trees
M Fampa, N Maculan
Numerical Algorithms 35 (2-4), 315-330, 2004
Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
W Melo, M Fampa, F Raupp
Journal of Global Optimization 60 (2), 373-389, 2014
Maximum-entropy remote sampling
KM Anstreicher, M Fampa, J Lee, J Williams
Discrete Applied Mathematics 108 (3), 211-226, 2001
Mixed-integer linear programming formulations for the software clustering problem
V K÷hler, M Fampa, O Ara˙jo
Computational Optimization and Applications 55 (1), 113-135, 2013
On global optimization with indefinite quadratics
M Fampa, J Lee, W Melo
EURO Journal on Computational Optimization 5 (3), 309-337, 2017
On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space
C D’Ambrosio, M Fampa, J Lee, S Vigerske
International Symposium on Experimental Algorithms, 122-133, 2015
Column generation approaches for the software clustering problem
HH Kramer, E Uchoa, M Fampa, V K÷hler, F Vanderbeck
Computational Optimization and Applications 64 (3), 843-864, 2016
An overview of exact algorithms for the Euclidean Steiner tree problem in n‐space
M Fampa, J Lee, N Maculan
International Transactions in Operational Research 23 (5), 861-874, 2016
Il sistema al momento non pu˛ eseguire l'operazione. Riprova pi¨ tardi.
Articoli 1–20