default search action
Miles Lubin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Ilias Zadik, Miles Lubin
, Juan Pablo Vielma
Shapes and recession cones in mixed-integer convex representability. Math. Program. 204(1): 739-752 (2024) - [j17]David L. Applegate, Mateo Díaz, Haihao Lu, Miles Lubin:
Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming. SIAM J. Optim. 34(1): 459-484 (2024) - 2023
- [j16]David L. Applegate, Oliver Hinder
Faster first-order primal-dual methods for linear programming using restarts and sharpness. Math. Program. 201(1): 133-184 (2023) - [j15]Miles Lubin
JuMP 1.0: recent improvements to a modeling language for mathematical optimization. Math. Program. Comput. 15(3): 581-589 (2023) - 2022
- [j14]Benoît Legat
MathOptInterface: A Data Structure for Mathematical Optimization Problems. INFORMS J. Comput. 34(2): 672-689 (2022) - [j13]Miles Lubin
Mixed-Integer Convex Representability. Math. Oper. Res. 47(1): 720-749 (2022) - [i9]Maxime Gasse, Quentin Cappart, Jonas Charfreitag, Laurent Charlin, Didier Chételat, Antonia Chmiela, Justin Dumouchelle, Ambros M. Gleixner, Aleksandr M. Kazachkov, Elias B. Khalil, Pawel Lichocki, Andrea Lodi, Miles Lubin, Chris J. Maddison, Christopher Morris, Dimitri J. Papageorgiou, Augustin Parjadis, Sebastian Pokutta, Antoine Prouvost, Lara Scavuzzo, Giulia Zarpellon, Linxin Yang, Sha Lai, Akang Wang, Xiaodong Luo, Xiang Zhou, Haohan Huang, Sheng Cheng Shao, Yuanming Zhu, Dong Zhang, Tao Quan, Zixuan Cao, Yang Xu, Zhewei Huang, Shuchang Zhou, Binbin Chen, Minggui He, Hao Hao, Zhiyu Zhang, Zhiwu An, Kun Mao:
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. CoRR abs/2203.02433 (2022) - [i8]Miles Lubin, Oscar Dowson, Joaquim Dias Garcia
JuMP 1.0. CoRR abs/2206.03866 (2022) - 2021
- [c9]Maxime Gasse, Simon Bowly, Quentin Cappart, Jonas Charfreitag, Laurent Charlin, Didier Chételat, Antonia Chmiela, Justin Dumouchelle, Ambros M. Gleixner, Aleksandr M. Kazachkov, Elias B. Khalil, Pawel Lichocki, Andrea Lodi, Miles Lubin, Chris J. Maddison, Christopher Morris, Dimitri J. Papageorgiou, Augustin Parjadis, Sebastian Pokutta, Antoine Prouvost, Lara Scavuzzo, Giulia Zarpellon, Linxin Yang, Sha Lai, Akang Wang, Xiaodong Luo, Xiang Zhou, Haohan Huang, Sheng Cheng Shao, Yuanming Zhu, Dong Zhang, Tao Quan, Zixuan Cao, Yang Xu, Zhewei Huang, Shuchang Zhou, Binbin Chen, Minggui He, Hao Hao, Zhiyu Zhang, Zhiwu An, Kun Mao:
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. NeurIPS (Competition and Demos) 2021: 220-231 - [c8]Nick Doudchenko, Khashayar Khosravi, Jean Pouget-Abadie, Sébastien Lahaie, Miles Lubin, Vahab S. Mirrokni, Jann Spiess, Guido Imbens:
Synthetic Design: An Optimization Approach to Experimental Design with Synthetic Controls. NeurIPS 2021: 8691-8701 - [c7]David L. Applegate, Mateo Díaz, Oliver Hinder, Haihao Lu, Miles Lubin, Brendan O'Donoghue, Warren Schudy:
Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient. NeurIPS 2021: 20243-20257 - 2020
- [j12]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) - [c6]Aditya Paliwal, Felix Gimeno, Vinod Nair, Yujia Li, Miles Lubin, Pushmeet Kohli, Oriol Vinyals:
Reinforced Genetic Algorithm Learning for Optimizing Computation Graphs. ICLR 2020
2010 – 2019
- 2019
- [i7]Aditya Paliwal
REGAL: Transfer Learning For Fast Optimization of Computation Graphs. CoRR abs/1905.02494 (2019) - 2018
- [j11]Miles Lubin
Polyhedral approximation in mixed-integer convex optimization. Math. Program. 172(1-2): 139-168 (2018) - [j10]Cosmin G. Petra, Feng Qiang
On efficient Hessian computation using the edge pushing algorithm in Julia. Optim. Methods Softw. 33(4-6): 1010-1029 (2018) - [i6]Miles Lubin, Yury Dvorkin, Line Roald:
Chance Constraints for Improving the Security of AC Optimal Power Flow. CoRR abs/1803.08754 (2018) - 2017
- [j9]Juan Pablo Vielma, Iain Dunning, Joey Huchette
Extended formulations in mixed integer conic quadratic programming. Math. Program. Comput. 9(3): 369-418 (2017) - [j8]Iain Dunning, Joey Huchette
JuMP: A Modeling Language for Mathematical Optimization. SIAM Rev. 59(2): 295-320 (2017) - [c5]Miles Lubin, Ilias Zadik, Juan Pablo Vielma:
Mixed-Integer Convex Representability. IPCO 2017: 392-404 - [i5]Carleton Coffrin, Russell Bent, Kaarthik Sundar, Yeesian Ng, Miles Lubin:
PowerModels.jl: An Open-Source Framework for Exploring Power Flow Formulations. CoRR abs/1711.01728 (2017) - 2016
- [j7]Dimitris Bertsimas, Iain Dunning, Miles Lubin:
Reformulation versus cutting-planes for robust optimization. Comput. Manag. Sci. 13(2): 195-217 (2016) - [c4]Miles Lubin, Emre Yamangil, Russell Bent
Extended Formulations in Mixed-Integer Convex Programming. IPCO 2016: 102-113 - [c3]Kaarthik Sundar
Unit commitment with N-1 Security and wind uncertainty. PSCC 2016: 1-7 - [i4]Kaarthik Sundar, Harsha Nagarajan, Miles Lubin, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock:
Unit Commitment with N-1 Security and Wind Uncertainty. CoRR abs/1602.00079 (2016) - [i3]Jarrett Revels, Miles Lubin, Theodore Papamarkou:
Forward-Mode Automatic Differentiation in Julia. CoRR abs/1607.07892 (2016) - 2015
- [j6]Miles Lubin, Iain Dunning:
Computing in Operations Research Using Julia. INFORMS J. Comput. 27(2): 238-248 (2015) - [j5]Iain Dunning, Vishal Gupta
A Course on Advanced Software Tools for Operations Research and Analytics. INFORMS Trans. Educ. 15(2): 169-179 (2015) - [i2]Iain Dunning, Joey Huchette, Miles Lubin:
JuMP: A Modeling Language for Mathematical Optimization. CoRR abs/1508.01982 (2015) - 2014
- [j4]Cosmin G. Petra, Olaf Schenk
An Augmented Incomplete Factorization Approach for Computing the Schur Complement in Stochastic Optimization. SIAM J. Sci. Comput. 36(2) (2014) - [c2]Joey Huchette
Parallel algebraic modeling for stochastic optimization. HPTCDL@SC 2014: 29-35 - 2013
- [j3]Miles Lubin, J. A. Julian Hall, Cosmin G. Petra, Mihai Anitescu
Parallel distributed-memory simplex for large-scale stochastic LP problems. Comput. Optim. Appl. 55(3): 571-596 (2013) - [j2]Miles Lubin, R. Kipp Martin, Cosmin G. Petra, Burhaneddin Sandikçi
On parallelizing dual decomposition in stochastic integer programming. Oper. Res. Lett. 41(3): 252-258 (2013) - [i1]Miles Lubin, Iain Dunning:
Computing in Operations Research using Julia. CoRR abs/1312.1431 (2013) - 2012
- [j1]Miles Lubin, Cosmin G. Petra, Mihai Anitescu
The parallel solution of dense saddle-point linear systems arising in stochastic programming. Optim. Methods Softw. 27(4-5): 845-864 (2012) - 2011
- [c1]Miles Lubin, Cosmin G. Petra, Mihai Anitescu
Scalable stochastic optimization of complex energy systems. SC 2011: 64:1-64:64
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-10-07 22:07 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: