A Computational Study of Search Strategies for Mixed Integer Programming. - Jeff T. Linderoth; Martin W. P. Savelsbergh (INFORMS J. Comput., 1999)

An Enabling Framework for Master-Worker Applications on the Computational Grid. - Jean-Pierre Goux; Sanjeev Kulkarni 001; Jeff T. Linderoth; Michael Yoder 003 (HPDC, 2000)

A Relational Modeling System for Linear and Integer Programming. - Alper Atamtürk; Ellis L. Johnson; Jeff T. Linderoth; Martin W. P. Savelsbergh (Oper. Res., 2000)

FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver. - Qun Chen; Michael C. Ferris; Jeff T. Linderoth (Ann. Oper. Res., 2001)

Master-Worker: An Enabling Framework for Applications on the Computational Grid. - Jean-Pierre Goux; Sanjeev Kulkarni 001; Michael Yoder 003; Jeff T. Linderoth (Clust. Comput., 2001)

A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems. - Jeff T. Linderoth; Eva K. Lee; Martin W. P. Savelsbergh (INFORMS J. Comput., 2001)

Solving large quadratic assignment problems on computational grids. - Kurt M. Anstreicher; Nathan W. Brixius; Jean-Pierre Goux; Jeff T. Linderoth (Math. Program., 2002)

A branch and cut approach to the cardinality constrained circuit problem. - Petra Bauer; Jeff T. Linderoth; Martin W. P. Savelsbergh (Math. Program., 2002)

Decomposition Algorithms for Stochastic Programming on a Computational Grid. - Jeff T. Linderoth; Stephen J. Wright 001 (Comput. Optim. Appl., 2003)

COAP 2003 Best Paper Award. - Jeff T. Linderoth; Steven J. Wright (Comput. Optim. Appl., 2004)

5. Computational Grids for Stochastic Programming. - Jeff T. Linderoth; Stephen J. Wright 001 (Applications of Stochastic Programming, 2005)

A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. - Jeff T. Linderoth (Math. Program., 2005)

The empirical behavior of sampling methods for stochastic programming. - Jeff T. Linderoth; Alexander Shapiro 001; Stephen J. Wright 001 (Ann. Oper. Res., 2006)

Optimization on grids - optimization for grids. - Jeff T. Linderoth; Roberto Musmanno (Parallel Comput., 2006)

Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables. - Oktay Günlük; Jeff T. Linderoth (IPCO, 2008)

Constraint Orbital Branching. - James Ostrowski; Jeff T. Linderoth; Fabrizio Rossi; Stefano Smriglio (IPCO, 2008)

Combining optimization and simulation for strategic and operational industrial gas production and distribution. - Wasu Glankwamdee; Jeff T. Linderoth; Jierui Shen; Peter Connard; Jim Hutton (Comput. Chem. Eng., 2008)

Reformulation and sampling to solve a stochastic network interdiction problem. - Udom Janjarassuk; Jeff T. Linderoth (Networks, 2008)

GRIP: scalable 3D global routing using integer programming. - Tai-Hsuan Wu; Azadeh Davoodi; Jeffrey T. Linderoth (DAC, 2009)

Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing. - Jeff T. Linderoth; François Margot; Greg Thain (INFORMS J. Comput., 2009)

A parallel integer programming approach to global routing. - Tai-Hsuan Wu; Azadeh Davoodi; Jeffrey T. Linderoth (DAC, 2010)

FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs. - Kumar Abhishek; Sven Leyffer; Jeff T. Linderoth (INFORMS J. Comput., 2010)

OR PRACTICE - R&D Project Portfolio Analysis for the Semiconductor Industry. - Banu Gemici-Ozkan; S. David Wu; Jeffrey T. Linderoth; Jeffry E. Moore (Oper. Res., 2010)

Perspective reformulations of mixed integer nonlinear programs with indicator variables. - Oktay Günlük; Jeff T. Linderoth (Math. Program., 2010)

A Probing Algorithm for MINLP with Failure Prediction by SVM. - Giacomo Nannicini; Pietro Belotti; Jon Lee 001; Jeff T. Linderoth; François Margot; Andreas Wächter (CPAIOR, 2011)

Power-driven global routing for multi-supply voltage domains. - Tai-Hsuan Wu; Azadeh Davoodi; Jeff T. Linderoth (DATE, 2011)

Congestion analysis for global routing via integer programming. - Hamid Shojaei; Azadeh Davoodi; Jeffrey T. Linderoth (ICCAD, 2011)

Valid Inequalities for the Pooling Problem with Binary Variables. - Claudia D'Ambrosio; Jeff T. Linderoth; James R. Luedtke (IPCO, 2011)

Optimal response to attacks on the open science grid. - Mine Altunay; Sven Leyffer; Jeffrey T. Linderoth; Zhen Xie (Comput. Networks, 2011)

Orbital branching. - James Ostrowski; Jeff T. Linderoth; Fabrizio Rossi; Stefano Smriglio (Math. Program., 2011)

Solving large Steiner Triple Covering Problems. - James Ostrowski; Jeff T. Linderoth; Fabrizio Rossi; Stefano Smriglio (Oper. Res. Lett., 2011)

GRIP: Global Routing via Integer Programming. - Tai-Hsuan Wu; Azadeh Davoodi; Jeffrey T. Linderoth (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2011)

The impact of sampling methods on bias and variance in stochastic linear programs. - Michael Freimer; Jeffrey T. Linderoth; Douglas J. Thomas (Comput. Optim. Appl., 2012)

Some results on the strength of relaxations of multilinear functions. - James R. Luedtke; Mahdi Namazifar; Jeff T. Linderoth (Math. Program., 2012)

On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators. - Hongbo Dong 001; Jeff T. Linderoth (IPCO, 2013)

Planning for local net congestion in global routing. - Hamid Shojaei; Azadeh Davoodi; Jeffrey T. Linderoth (ISPD, 2013)

Mixed-integer nonlinear optimization. - Pietro Belotti; Christian Kirches; Sven Leyffer; Jeff T. Linderoth; James R. Luedtke; Ashutosh Mahajan (Acta Numer., 2013)

Locally ideal formulations for piecewise linear functions with indicator variables. - Srikrishna Sridhar; Jeff T. Linderoth; James R. Luedtke (Oper. Res. Lett., 2013)

Power-Driven Global Routing for Multisupply Voltage Domains. - Tai-Hsuan Wu; Azadeh Davoodi; Jeffrey T. Linderoth (VLSI Design, 2013)

Strong-branching inequalities for convex mixed integer nonlinear programs. - Mustafa R. Kilinç; Jeff T. Linderoth; James R. Luedtke; Andrew Miller (Comput. Optim. Appl., 2014)

Models and solution techniques for production planning problems with increasing byproducts. - Srikrishna Sridhar; Jeffrey T. Linderoth; James R. Luedtke (J. Glob. Optim., 2014)

Optimally solving Markov decision processes with total expected discounted reward function: Linear programming revisited. - Oguzhan Alagöz; Mehmet U. S. Ayvaci; Jeffrey T. Linderoth (Comput. Ind. Eng., 2015)

Regularization vs. Relaxation: A conic optimization perspective of statistical variable selection. - Hongbo Dong 001; Kun Chen; Jeff T. Linderoth (CoRR, 2015)

A procedure for improving the distribution of congestion in global routing. - Daohang Shi; Azadeh Davoodi; Jeffrey T. Linderoth (DATE, 2016)

Optimizing customized program coverage. - Peter Ohmann; David Bingham Brown; Naveen Neelakandan; Jeff T. Linderoth; Ben Liblit (ASE, 2016)

A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching. - Burak Kocuk; Hyemin Jeon; Santanu S. Dey; Jeff T. Linderoth; James R. Luedtke; Xu Andy Sun (Oper. Res., 2016)

Special issue on "Integer programming under uncertainty". - Shabbir Ahmed; Jeff T. Linderoth (Math. Program., 2016)

Data-enabled cognitive modeling: Validating student engineers' fuzzy design-based decision-making in a virtual design problem. - Golnaz Arastoopour Irgens; Naomi C. Chesler; Jeffrey T. Linderoth; David Williamson Shaffer (Comput. Appl. Eng. Educ., 2017)

Quadratic cone cutting surfaces for quadratic programs with on-off constraints. - Hyemin Jeon; Jeff T. Linderoth; Andrew Miller (Discret. Optim., 2017)

Lift-and-project cuts for convex mixed integer nonlinear programs. - Mustafa R. Kilinç; Jeff T. Linderoth; James R. Luedtke (Math. Program. Comput., 2017)

High Throughput Computing for Massive Scenario Analysis and Optimization to Minimize Cascading Blackout Risk. - Eric James Anderson; Jeff T. Linderoth (IEEE Trans. Smart Grid, 2017)

Designing and Implementing Algorithms for Mixed-Integer Nonlinear Optimization (Dagstuhl Seminar 18081). - Pierre Bonami; Ambros M. Gleixner; Jeff T. Linderoth; Ruth Misener (Dagstuhl Reports, 2018)

Valid inequalities for separable concave constraints with indicator variables. - Cong Han Lim; Jeff T. Linderoth; James R. Luedtke (Math. Program., 2018)

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. - Pierre Bonami; Oktay Günlük; Jeff T. Linderoth (Math. Program. Comput., 2018)

Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming. - Natashia Boland; Jeffrey Christiansen; Brian C. Dandurand; Andrew C. Eberhard; Jeff T. Linderoth; James R. Luedtke; Fabricio Oliveira (SIAM J. Optim., 2018)

The Mathematical Foundations of Epistemic Network Analysis. - Dale Bowman; Zachari Swiecki; Zhiqiang Cai 002; Yeyu Wang; Brendan R. Eagan; Jeff T. Linderoth; David Williamson Shaffer (ICQE, 2020)

Strong Convex Nonlinear Relaxations of the Pooling Problem. - James R. Luedtke; Claudia D'Ambrosio; Jeff T. Linderoth; Jonas Schweiger (SIAM J. Optim., 2020)

Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets. - Alberto Del Pia; Jeff T. Linderoth; Haoran Zhu (IPCO, 2021)

MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. - Ambros M. Gleixner; Gregor Hendel; Gerald Gamrath; Tobias Achterberg; Michael Bastubbe; Timo Berthold; Philipp M. Christophel; Kati Jarck; Thorsten Koch; Jeff T. Linderoth; Marco E. Lübbecke; Hans D. Mittelmann; et al. (Math. Program. Comput., 2021)

Minotaur: a mixed-integer nonlinear optimization toolkit. - Ashutosh Mahajan; Sven Leyffer; Jeff T. Linderoth; James R. Luedtke; Todd S. Munson (Math. Program. Comput., 2021)

Integer packing sets form a well-quasi-ordering. - Alberto Del Pia; Dion Gijswijt; Jeff T. Linderoth; Haoran Zhu (Oper. Res. Lett., 2021)

Piecewise polyhedral formulations for a multilinear term. - Kaarthik Sundar; Harsha Nagarajan; Jeff T. Linderoth; Site Wang; Russell Bent (Oper. Res. Lett., 2021)

Parallelizing Subgradient Methods for the Lagrangian Dual in Stochastic Mixed-Integer Programming. - Cong Han Lim; Jeffrey T. Linderoth; James R. Luedtke; Stephen J. Wright 001 (INFORMS J. Optim., 2021)

Orbital Conflict: Cutting Planes for Symmetric Integer Programs. - Jeff T. Linderoth; José Núñez Ares; James Ostrowski; Fabrizio Rossi; Stefano Smriglio (INFORMS J. Optim., 2021)

On the Complexity of Separation from the Knapsack Polytope. - Alberto Del Pia; Jeff T. Linderoth; Haoran Zhu (IPCO, 2022)

The hierarchical organization of autocatalytic reaction networks and its relevance to the origin of life. - Zhen Peng; Jeff T. Linderoth; David A. Baum (PLoS Comput. Biol., 2022)

Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation. - Alberto Del Pia; Jeff T. Linderoth; Haoran Zhu (Math. Program., 2023)

New classes of Facets for complementarity knapsack problems. - Alberto Del Pia; Jeff T. Linderoth; Haoran Zhu (Discret. Appl. Math., 2024)

A Set-Covering Approach to Customized Coverage Instrumentation. - Carla Michini; Peter Ohmann; Ben Liblit; Jeff T. Linderoth (INFORMS J. Comput., 2024)

On the complexity of separating cutting planes for the knapsack polytope. - Alberto Del Pia; Jeff T. Linderoth; Haoran Zhu (Math. Program., 2024)

Relaxations and cutting planes for linear programs with complementarity constraints. - Alberto Del Pia; Jeff T. Linderoth; Haoran Zhu (J. Glob. Optim., 2024)

An Integer Programming Approach to Subspace Clustering with Missing Data. - Akhilesh Soni; Jeff T. Linderoth; James R. Luedtke; Daniel L. Pimentel-Alarcón (INFORMS J. Optim., 2025)

Stability Analysis of Discrete-Time Linear Complementarity Systems. - Arvind U. Raghunathan; Jeffrey T. Linderoth (SIAM J. Optim., 2025)