The following pages link to Juan Carlos Vera (Q883333):
Displayed 50 items.
- (Q263182) (redirect page) (← links)
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- On the convergence rate of grid search for polynomial optimization over the simplex (Q519777) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Logconcave random graphs (Q986716) (← links)
- Computing near-optimal value-at-risk portfolios using integer programming techniques (Q1754091) (← links)
- On approximating the b-chromatic number (Q1765381) (← links)
- Computing arbitrage upper bounds on basket options in the presence of bid-ask spreads (Q1926944) (← links)
- Phase transition for the mixing time of the Glauber dynamics for coloring regular trees (Q1931316) (← links)
- New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
- On the \(P_3\)-hull number of Kneser graphs (Q2048567) (← links)
- Static hedging of weather and price risks in electricity markets (Q2069163) (← links)
- A guide for sparse PCA: model comparison and applications (Q2073736) (← links)
- Correction to: ``Static hedging of weather and price risks in electricity markets'' (Q2138311) (← links)
- A note on homomorphisms of Kneser hypergraphs (Q2284780) (← links)
- New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- Independence and coloring properties of direct products of some vertex-transitive graphs (Q2509308) (← links)
- On the diameter of Kneser graphs (Q2581434) (← links)
- Majorization and Extremal PH Distributions (Q2841724) (← links)
- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions (Q2851895) (← links)
- (Q2865856) (← links)
- On Some Properties of Bivariate Exponential Distributions (Q2904310) (← links)
- (Q2921681) (← links)
- (Q2921682) (← links)
- (Q2934584) (← links)
- Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs (Q3004990) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- Static-arbitrage lower bounds on the prices of basket options via linear programming (Q3063848) (← links)
- Reconstruction for Colorings on Trees (Q3094945) (← links)
- Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees (Q3192167) (← links)
- Improved Bounds for the Symmetric Rendezvous Value on the Line (Q3392207) (← links)
- Randomly coloring planar graphs with fewer colors than the maximum degree (Q3460517) (← links)
- On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem (Q3581403) (← links)
- A Geometric Preferential Attachment Model of Networks II (Q3622691) (← links)
- Random Deletion in a Scale-Free Random Graph Process (Q4672749) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- Adversarial Deletion in a Scale-Free Random Graph Process (Q5295413) (← links)
- (Q5302103) (← links)
- Algorithms and Models for the Web-Graph (Q5311173) (← links)
- (Q5365092) (← links)
- Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations (Q5376454) (← links)
- The Influence of Search Engines on Preferential Attachment (Q5384926) (← links)
- (Q5387670) (← links)
- (Q5417738) (← links)
- On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem (Q5443801) (← links)
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming (Q5444282) (← links)
- Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet (Q5458296) (← links)