Juan C. Vera
Orcid: 0000-0003-1394-3422Affiliations:
- Tilburg University, Department of Econometrics and Operations Research, The Netherlands
- University of Waterloo, Department of Management Sciences, Canada (2007 - 2010)
- Georgia Institute of Technology, College of Computing, Atlanta, GA, USA (2006 - 2007)
- Carnegie Mellon University, Department of Mathematical Sciences, Pittsburgh, PA, USA (PhD 2006)
According to our database1,
Juan C. Vera
authored at least 46 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
On csauthors.net:
Bibliography
2024
Reducing Nonnegativity over General Semialgebraic Sets to Nonnegativity over Simple Sets.
SIAM J. Optim., 2024
2023
Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint.
Adv. Data Anal. Classif., March, 2023
Math. Oper. Res., February, 2023
2022
INFORMS J. Comput., 2022
2021
Math. Program., 2021
2020
Theory Comput. Syst., 2020
Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques.
INFORMS J. Comput., 2020
2018
Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations.
SIAM J. Optim., 2018
Computing near-optimal Value-at-Risk portfolios using integer programming techniques.
Eur. J. Oper. Res., 2018
2017
Public Transp., 2017
Optim. Lett., 2017
Approximating the cone of copositive kernels to estimate the stability number of infinite graphs.
Electron. Notes Discret. Math., 2017
Electron. Notes Discret. Math., 2017
2016
Math. Program., 2016
2015
SIAM J. Discret. Math., 2015
Random Struct. Algorithms, 2015
Math. Program., 2015
2014
SIAM J. Discret. Math., 2014
2012
SIGMETRICS Perform. Evaluation Rev., 2012
Computing arbitrage upper bounds on basket options in the presence of bid-ask spreads.
Eur. J. Oper. Res., 2012
2011
SIAM J. Optim., 2011
Proceedings of the Matrix-Analytic Methods in Stochastic Models, 2011
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
2010
Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition.
Algorithmic Oper. Res., 2010
Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
2008
2007
SIAM J. Optim., 2007
On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem.
Comb. Probab. Comput., 2007
Comb. Probab. Comput., 2007
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007
2006
Discret. Math. Theor. Comput. Sci., 2006
Independence and coloring properties of direct products of some vertex-transitive graphs.
Discret. Math., 2006
2005
2003