Jeff T. Linderoth

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 29

Top Topics

Integer Program

Quadratic Program

Valid Inequalities

Multiple Knapsack

Top Venues

Math. Program. Comput.

Publications

Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
Relaxations and cutting planes for linear programs with complementarity constraints. J. Glob. Optim. 90 (1) (2024)
Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
On the complexity of separating cutting planes for the knapsack polytope. Math. Program. 206 (1) (2024)
Carla Michini, Peter Ohmann, Ben Liblit, Jeff T. Linderoth
A Set-Covering Approach to Customized Coverage Instrumentation. INFORMS J. Comput. 36 (1) (2024)
Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
New classes of Facets for complementarity knapsack problems. Discret. Appl. Math. 356 (2024)
Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation. Math. Program. 197 (2) (2023)
Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
On the Complexity of Separation from the Knapsack Polytope. IPCO (2022)
Zhen Peng, Jeff T. Linderoth, David A. Baum
The hierarchical organization of autocatalytic reaction networks and its relevance to the origin of life. PLoS Comput. Biol. 18 (9) (2022)
Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
New Classes of Facets for Complementarity Knapsack Problems. ISCO (2022)
Kaarthik Sundar, Harsha Nagarajan, Jeff T. Linderoth, Site Wang, Russell Bent
Piecewise polyhedral formulations for a multilinear term. Oper. Res. Lett. 49 (1) (2021)
Ashutosh Mahajan, Sven Leyffer, Jeff T. Linderoth, James R. Luedtke, Todd S. Munson
Minotaur: a mixed-integer nonlinear optimization toolkit. Math. Program. Comput. 13 (2) (2021)
Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets. IPCO (2021)
Jeff T. Linderoth, José Núñez Ares, James Ostrowski, Fabrizio Rossi, Stefano Smriglio
Orbital Conflict: Cutting Planes for Symmetric Integer Programs. INFORMS J. Optim. 3 (2) (2021)
Ambros M. Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff T. Linderoth, Marco E. Lübbecke, Hans D. Mittelmann, Derya B. Özyurt, Ted K. Ralphs, Domenico Salvagnin, Yuji Shinano
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13 (3) (2021)
Alberto Del Pia, Dion Gijswijt, Jeff T. Linderoth, Haoran Zhu
Integer packing sets form a well-quasi-ordering. Oper. Res. Lett. 49 (2) (2021)
Dale Bowman, Zachari Swiecki, Zhiqiang Cai, Yeyu Wang, Brendan R. Eagan, Jeff T. Linderoth, David Williamson Shaffer
The Mathematical Foundations of Epistemic Network Analysis. ICQE (2020)
James R. Luedtke, Claudia D'Ambrosio, Jeff T. Linderoth, Jonas Schweiger
Strong Convex Nonlinear Relaxations of the Pooling Problem. SIAM J. Optim. 30 (2) (2020)
Kaarthik Sundar, Harsha Nagarajan, Site Wang, Jeff T. Linderoth, Russell Bent
Piecewise Polyhedral Formulations for a Multilinear Term. CoRR (2020)
Pierre Bonami, Oktay Günlük, Jeff T. Linderoth
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. Math. Program. Comput. 10 (3) (2018)
Natashia Boland, Jeffrey Christiansen, Brian C. Dandurand, Andrew C. Eberhard, Jeff T. Linderoth, James R. Luedtke, Fabricio Oliveira
Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming. SIAM J. Optim. 28 (2) (2018)
Pierre Bonami, Ambros M. Gleixner, Jeff T. Linderoth, Ruth Misener
Designing and Implementing Algorithms for Mixed-Integer Nonlinear Optimization (Dagstuhl Seminar 18081). Dagstuhl Reports 8 (2) (2018)
Cong Han Lim, Jeff T. Linderoth, James R. Luedtke
Valid inequalities for separable concave constraints with indicator variables. Math. Program. 172 (1-2) (2018)
Hyemin Jeon, Jeff T. Linderoth, Andrew Miller
Quadratic cone cutting surfaces for quadratic programs with on-off constraints. Discret. Optim. 24 (2017)
Mustafa R. Kilinç, Jeff T. Linderoth, James R. Luedtke
Lift-and-project cuts for convex mixed integer nonlinear programs. Math. Program. Comput. 9 (4) (2017)
Eric James Anderson, Jeff T. Linderoth
High Throughput Computing for Massive Scenario Analysis and Optimization to Minimize Cascading Blackout Risk. IEEE Trans. Smart Grid 8 (3) (2017)
Burak Kocuk, Hyemin Jeon, Santanu S. Dey, Jeff T. Linderoth, James R. Luedtke, Xu Andy Sun
A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching. Oper. Res. 64 (4) (2016)
Cong Han Lim, Jeff T. Linderoth, James R. Luedtke
Valid Inequalities for Separable Concave Constraints with Indicator Variables. IPCO (2016)
Peter Ohmann, David Bingham Brown, Naveen Neelakandan, Jeff T. Linderoth, Ben Liblit
Optimizing customized program coverage. ASE (2016)
Shabbir Ahmed, Jeff T. Linderoth
Special issue on "Integer programming under uncertainty". Math. Program. 157 (1) (2016)
Hongbo Dong, Kun Chen, Jeff T. Linderoth
Regularization vs. Relaxation: A conic optimization perspective of statistical variable selection. CoRR (2015)
Mustafa R. Kilinç, Jeff T. Linderoth, James R. Luedtke, Andrew Miller
Strong-branching inequalities for convex mixed integer nonlinear programs. Comput. Optim. Appl. 59 (3) (2014)
Srikrishna Sridhar, Jeff T. Linderoth, James R. Luedtke
Locally ideal formulations for piecewise linear functions with indicator variables. Oper. Res. Lett. 41 (6) (2013)
Pietro Belotti, Christian Kirches, Sven Leyffer, Jeff T. Linderoth, James R. Luedtke, Ashutosh Mahajan
Mixed-integer nonlinear optimization. Acta Numer. 22 (2013)
Hongbo Dong, Jeff T. Linderoth
On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators. IPCO (2013)
James R. Luedtke, Mahdi Namazifar, Jeff T. Linderoth
Some results on the strength of relaxations of multilinear functions. Math. Program. 136 (2) (2012)
James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio
Solving large Steiner Triple Covering Problems. Oper. Res. Lett. 39 (2) (2011)
Claudia D'Ambrosio, Jeff T. Linderoth, James R. Luedtke
Valid Inequalities for the Pooling Problem with Binary Variables. IPCO (2011)
James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio
Orbital branching. Math. Program. 126 (1) (2011)
Tai-Hsuan Wu, Azadeh Davoodi, Jeff T. Linderoth
Power-driven global routing for multi-supply voltage domains. DATE (2011)
Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff T. Linderoth, François Margot, Andreas Wächter
A Probing Algorithm for MINLP with Failure Prediction by SVM. CPAIOR (2011)
Oktay Günlük, Jeff T. Linderoth
Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124 (1-2) (2010)
Kumar Abhishek, Sven Leyffer, Jeff T. Linderoth
FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs. INFORMS J. Comput. 22 (4) (2010)
Jeff T. Linderoth, François Margot, Greg Thain
Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing. INFORMS J. Comput. 21 (3) (2009)
Udom Janjarassuk, Jeff T. Linderoth
Reformulation and sampling to solve a stochastic network interdiction problem. Networks 52 (3) (2008)
James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio
Constraint Orbital Branching. IPCO (2008)
Oktay Günlük, Jeff T. Linderoth
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables. IPCO (2008)
Wasu Glankwamdee, Jeff T. Linderoth, Jierui Shen, Peter Connard, Jim Hutton
Combining optimization and simulation for strategic and operational industrial gas production and distribution. Comput. Chem. Eng. 32 (11) (2008)
James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio
Orbital Branching. IPCO (2007)
Jeff T. Linderoth, Roberto Musmanno
Optimization on grids - optimization for grids. Parallel Comput. 32 (9) (2006)
Jeff T. Linderoth, Alexander Shapiro, Stephen J. Wright
The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142 (1) (2006)
Jeff T. Linderoth
A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Program. 103 (2) (2005)
Jeff T. Linderoth, Steven J. Wright
COAP 2003 Best Paper Award. Comput. Optim. Appl. 29 (2) (2004)
Jeff T. Linderoth, Stephen J. Wright
Decomposition Algorithms for Stochastic Programming on a Computational Grid. Comput. Optim. Appl. 24 (2-3) (2003)
Kurt M. Anstreicher, Nathan W. Brixius, Jean-Pierre Goux, Jeff T. Linderoth
Solving large quadratic assignment problems on computational grids. Math. Program. 91 (3) (2002)
Petra Bauer, Jeff T. Linderoth, Martin W. P. Savelsbergh
A branch and cut approach to the cardinality constrained circuit problem. Math. Program. 91 (2) (2002)
Jean-Pierre Goux, Sanjeev Kulkarni, Michael Yoder, Jeff T. Linderoth
Master-Worker: An Enabling Framework for Applications on the Computational Grid. Clust. Comput. 4 (1) (2001)
Jeff T. Linderoth, Eva K. Lee, Martin W. P. Savelsbergh
A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems. INFORMS J. Comput. 13 (3) (2001)
Qun Chen, Michael C. Ferris, Jeff T. Linderoth
FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver. Ann. Oper. Res. 103 (1-4) (2001)
Jean-Pierre Goux, Sanjeev Kulkarni, Jeff T. Linderoth, Michael Yoder
An Enabling Framework for Master-Worker Applications on the Computational Grid. HPDC (2000)
Alper Atamtürk, Ellis L. Johnson, Jeff T. Linderoth, Martin W. P. Savelsbergh
A Relational Modeling System for Linear and Integer Programming. Oper. Res. 48 (6) (2000)
Jeff T. Linderoth, Martin W. P. Savelsbergh
A Computational Study of Search Strategies for Mixed Integer Programming. INFORMS J. Comput. 11 (2) (1999)