default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan Pablo Vielma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j45]Lea Kapelevich
, Erling D. Andersen, Juan Pablo Vielma:
Computing Conjugate Barrier Information for Nonsymmetric Cones. J. Optim. Theory Appl. 202(1): 271-295 (2024)- [j44]Ilias Zadik, Miles Lubin, Juan Pablo Vielma:
Shapes and recession cones in mixed-integer convex representability. Math. Program. 204(1): 739-752 (2024) - 2023
- [j43]Joey Huchette, Juan Pablo Vielma:
Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools. Oper. Res. 71(5): 1835-1856 (2023) - [j42]Chris Coey, Lea Kapelevich, Juan Pablo Vielma:
Conic Optimization with Spectral Functions on Euclidean Jordan Algebras. Math. Oper. Res. 48(4): 1906-1933 (2023) - [j41]Andrea Lodi, Mathieu Tanneau, Juan Pablo Vielma:
Disjunctive cuts in Mixed-Integer Conic Optimization. Math. Program. 199(1): 671-719 (2023) - [j40]Lea Kapelevich, Chris Coey, Juan Pablo Vielma:
Sum of squares generalizations for conic sets. Math. Program. 199(1): 1417-1429 (2023) - [j39]Chris Coey, Lea Kapelevich, Juan Pablo Vielma:
Performance enhancements for a generic conic interior point algorithm. Math. Program. Comput. 15(1): 53-101 (2023) - [j38]Miles Lubin, Oscar Dowson, Joaquim Dias Garcia, Joey Huchette, Benoît Legat, Juan Pablo Vielma:
JuMP 1.0: recent improvements to a modeling language for mathematical optimization. Math. Program. Comput. 15(3): 581-589 (2023) - 2022
- [j37]Chris Coey, Lea Kapelevich, Juan Pablo Vielma:
Solving Natural Conic Formulations with Hypatia.jl. INFORMS J. Comput. 34(5): 2686-2699 (2022) - [j36]Miles Lubin, Juan Pablo Vielma, Ilias Zadik:
Mixed-Integer Convex Representability. Math. Oper. Res. 47(1): 720-749 (2022) - [c8]Theodore P. Papalexopoulos, Christian Tjandraatmadja, Ross Anderson, Juan Pablo Vielma, David Belanger:
Constrained Discrete Black-Box Optimization using Mixed-Integer Programming. ICML 2022: 17295-17322 - [i5]Miles Lubin, Oscar Dowson, Joaquim Dias Garcia, Joey Huchette, Benoît Legat, Juan Pablo Vielma:
JuMP 1.0. CoRR abs/2206.03866 (2022) - 2020
- [j35]Sajad Modaresi, Denis Sauré, Juan Pablo Vielma:
Learning in Combinatorial Optimization: What and How to Explore. Oper. Res. 68(5): 1585-1604 (2020) - [j34]Ross Anderson, Joey Huchette, Will Ma, Christian Tjandraatmadja, Juan Pablo Vielma:
Strong mixed-integer programming formulations for trained neural networks. Math. Program. 183(1): 3-39 (2020) - [j33]Chris Coey, Miles Lubin, Juan Pablo Vielma:
Outer approximation with conic certificates for mixed-integer convex problems. Math. Program. Comput. 12(2): 249-293 (2020) - [c7]Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, Juan Pablo Vielma:
The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification. NeurIPS 2020 - [i4]Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, Juan Pablo Vielma:
The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification. CoRR abs/2006.14076 (2020)
2010 – 2019
- 2019
- [j32]Denis Sauré, Juan Pablo Vielma:
Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis. Oper. Res. 67(2): 315-338 (2019) - [j31]Joey Huchette, Juan Pablo Vielma:
A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints. Math. Oper. Res. 44(3): 793-820 (2019) - [j30]Juan Pablo Vielma:
Small and strong formulations for unions of convex sets from the Cayley embedding. Math. Program. 177(1-2): 21-53 (2019) - [j29]Joey Huchette, Juan Pablo Vielma:
A geometric way to build strong mixed-integer programming formulations. Oper. Res. Lett. 47(6): 601-606 (2019) - [c6]Ross Anderson, Joey Huchette, Christian Tjandraatmadja, Juan Pablo Vielma:
Strong Mixed-Integer Programming Formulations for Trained Neural Networks. IPCO 2019: 27-42 - 2018
- [j28]Joey Huchette, Santanu S. Dey, Juan Pablo Vielma:
Strong mixed-integer formulations for the floor layout problem. INFOR Inf. Syst. Oper. Res. 56(4): 392-433 (2018) - [j27]Joey Huchette, Santanu S. Dey, Juan Pablo Vielma:
Beating the SDP bound for the floor layout problem: a simple combinatorial idea. INFOR Inf. Syst. Oper. Res. 56(4): 457-481 (2018) - [j26]Juan Pablo Vielma:
Embedding Formulations and Complexity for Unions of Polyhedra. Manag. Sci. 64(10): 4721-4734 (2018) - [j25]Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma:
Polyhedral approximation in mixed-integer convex optimization. Math. Program. 172(1-2): 139-168 (2018) - [i3]Jarrett Revels, Tim Besard, Valentin Churavy, Bjorn De Sutter, Juan Pablo Vielma:
Dynamic Automatic Differentiation of GPU Broadcast Kernels. CoRR abs/1810.08297 (2018) - [i2]Ross Anderson, Joey Huchette, Christian Tjandraatmadja, Juan Pablo Vielma:
Strong mixed-integer programming formulations for trained neural networks. CoRR abs/1811.08359 (2018) - 2017
- [j24]Sina Modaresi, Juan Pablo Vielma:
Convex hull of two quadratic or a conic quadratic and a quadratic inequality. Math. Program. 164(1-2): 383-409 (2017) - [j23]Juan Pablo Vielma, Iain Dunning, Joey Huchette, Miles Lubin:
Extended formulations in mixed integer conic quadratic programming. Math. Program. Comput. 9(3): 369-418 (2017) - [c5]Miles Lubin, Ilias Zadik, Juan Pablo Vielma:
Mixed-Integer Convex Representability. IPCO 2017: 392-404 - 2016
- [j22]Sina Modaresi, Mustafa R. Kilinç, Juan Pablo Vielma:
Intersection cuts for nonlinear integer programming: convexification techniques for structured sets. Math. Program. 155(1-2): 575-611 (2016) - [j21]Luis Rademacher, Alejandro Toriello, Juan Pablo Vielma:
On packing and covering polyhedra in infinite dimensions. Oper. Res. Lett. 44(2): 225-230 (2016) - [c4]Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma:
Extended Formulations in Mixed-Integer Convex Programming. IPCO 2016: 102-113 - [i1]Carter Mundell, Juan Pablo Vielma, Tauhid Zaman:
Predicting Performance Under Stressful Conditions Using Galvanic Skin Response. CoRR abs/1606.01836 (2016) - 2015
- [j20]Guido Lagos, Daniel G. Espinoza, Eduardo Moreno, Juan Pablo Vielma:
Restricted risk measures and robust optimization. Eur. J. Oper. Res. 241(3): 771-782 (2015) - [j19]Sina Modaresi, Mustafa R. Kilinç, Juan Pablo Vielma:
Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming. Oper. Res. Lett. 43(1): 10-15 (2015) - [j18]Juan Pablo Vielma:
Mixed Integer Linear Programming Formulation Techniques. SIAM Rev. 57(1): 3-57 (2015) - 2014
- [j17]Sanjeeb Dash, Oktay Günlük, Juan Pablo Vielma:
Computational Experiments with Cross and Crooked Cross Cuts. INFORMS J. Comput. 26(4): 780-797 (2014) - [j16]Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma:
On the Chvátal-Gomory closure of a compact convex set. Math. Program. 145(1-2): 327-348 (2014) - 2013
- [j15]Rodolfo Carvajal, Miguel Constantino, Marcos Goycoolea, Juan Pablo Vielma, Andrés Weintraub:
Imposing Connectivity Constraints in Forest Planning Models. Oper. Res. 61(4): 824-836 (2013) - [j14]Sercan Yildiz, Juan Pablo Vielma:
Incremental and encoding formulations for Mixed Integer Programming. Oper. Res. Lett. 41(6): 654-658 (2013) - 2012
- [j13]Alejandro Toriello, Juan Pablo Vielma:
Fitting piecewise linear continuous functions. Eur. J. Oper. Res. 219(1): 86-95 (2012) - [j12]Alexandre S. Freire, Eduardo Moreno, Juan Pablo Vielma:
An integer linear programming approach for bilinear integer programming. Oper. Res. Lett. 40(2): 74-77 (2012) - [j11]Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser:
Mixed integer linear programming formulations for probabilistic constraints. Oper. Res. Lett. 40(3): 153-158 (2012) - [j10]Diego A. Morán R., Santanu S. Dey, Juan Pablo Vielma:
A Strong Dual for Conic Mixed-Integer Programs. SIAM J. Optim. 22(3): 1136-1150 (2012) - 2011
- [j9]Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma:
The Chvátal-Gomory Closure of a Strictly Convex Body. Math. Oper. Res. 36(2): 227-239 (2011) - [j8]Juan Pablo Vielma, George L. Nemhauser:
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128(1-2): 49-72 (2011) - [j7]Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma:
The split closure of a strictly convex body. Oper. Res. Lett. 39(2): 121-126 (2011) - [c3]Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma:
On the Chvátal-Gomory Closure of a Compact Convex Set. IPCO 2011: 130-142 - 2010
- [j6]Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser:
A Note on "A Superior Representation Method for Piecewise Linear Functions". INFORMS J. Comput. 22(3): 493-497 (2010) - [j5]Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser:
Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions. Oper. Res. 58(2): 303-315 (2010) - [c2]Santanu S. Dey, Juan Pablo Vielma:
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron. IPCO 2010: 327-340
2000 – 2009
- 2009
- [b1]Juan Pablo Vielma Centeno:
Mixed integer programming approaches for nonlinear and stochastic programming. Georgia Institute of Technology, Atlanta, GA, USA, 2009 - 2008
- [j4]Juan Pablo Vielma, Ahmet B. Keha, George L. Nemhauser:
Nonconvex, lower semicontinuous piecewise linear optimization. Discret. Optim. 5(2): 467-488 (2008) - [j3]Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser:
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs. INFORMS J. Comput. 20(3): 438-450 (2008) - [c1]Juan Pablo Vielma, George L. Nemhauser:
Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints. IPCO 2008: 199-213 - 2007
- [j2]Juan Pablo Vielma, Alan T. Murray, David M. Ryan, Andrés Weintraub:
Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems. Eur. J. Oper. Res. 176(2): 1246-1264 (2007) - [j1]Juan Pablo Vielma:
A constructive characterization of the split closure of a mixed integer linear program. Oper. Res. Lett. 35(1): 29-35 (2007)
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 2025-04-08 00:04 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:
