Jeff T. Linderoth

  • University of Wisconsin-Madison, Department of Industrial and Systems Engineering, WI, USA

According to our database1, Jeff T. Linderoth authored at least 63 papers between 1999 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



On the Complexity of Separation from the Knapsack Polytope.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Piecewise polyhedral formulations for a multilinear term.
Oper. Res. Lett., 2021

Integer packing sets form a well-quasi-ordering.
Oper. Res. Lett., 2021

Minotaur: a mixed-integer nonlinear optimization toolkit.
Math. Program. Comput., 2021

MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library.
Math. Program. Comput., 2021

Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets.
Proceedings of the Integer Programming and Combinatorial Optimization, 2021

Strong Convex Nonlinear Relaxations of the Pooling Problem.
SIAM J. Optim., 2020

The Mathematical Foundations of Epistemic Network Analysis.
Proceedings of the Advances in Quantitative Ethnography - Second International Conference, 2020

Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming.
SIAM J. Optim., 2018

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods.
Math. Program. Comput., 2018

Valid inequalities for separable concave constraints with indicator variables.
Math. Program., 2018

Designing and Implementing Algorithms for Mixed-Integer Nonlinear Optimization (Dagstuhl Seminar 18081).
Dagstuhl Reports, 2018

High Throughput Computing for Massive Scenario Analysis and Optimization to Minimize Cascading Blackout Risk.
IEEE Trans. Smart Grid, 2017

Lift-and-project cuts for convex mixed integer nonlinear programs.
Math. Program. Comput., 2017

Quadratic cone cutting surfaces for quadratic programs with on-off constraints.
Discret. Optim., 2017

Data-enabled cognitive modeling: Validating student engineers' fuzzy design-based decision-making in a virtual design problem.
Comput. Appl. Eng. Educ., 2017

Special issue on "Integer programming under uncertainty".
Math. Program., 2016

A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching.
Oper. Res., 2016

Optimizing customized program coverage.
Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering, 2016

A procedure for improving the distribution of congestion in global routing.
Proceedings of the 2016 Design, Automation & Test in Europe Conference & Exhibition, 2016

Regularization vs. Relaxation: A conic optimization perspective of statistical variable selection.
CoRR, 2015

Optimally solving Markov decision processes with total expected discounted reward function: Linear programming revisited.
Comput. Ind. Eng., 2015

Models and solution techniques for production planning problems with increasing byproducts.
J. Glob. Optim., 2014

Strong-branching inequalities for convex mixed integer nonlinear programs.
Comput. Optim. Appl., 2014

Power-Driven Global Routing for Multisupply Voltage Domains.
VLSI Design, 2013

Locally ideal formulations for piecewise linear functions with indicator variables.
Oper. Res. Lett., 2013

Mixed-integer nonlinear optimization.
Acta Numer., 2013

Planning for local net congestion in global routing.
Proceedings of the International Symposium on Physical Design, 2013

On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Some results on the strength of relaxations of multilinear functions.
Math. Program., 2012

The impact of sampling methods on bias and variance in stochastic linear programs.
Comput. Optim. Appl., 2012

GRIP: Global Routing via Integer Programming.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2011

Solving large Steiner Triple Covering Problems.
Oper. Res. Lett., 2011

Orbital branching.
Math. Program., 2011

Optimal response to attacks on the open science grid.
Comput. Networks, 2011

Valid Inequalities for the Pooling Problem with Binary Variables.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Congestion analysis for global routing via integer programming.
Proceedings of the 2011 IEEE/ACM International Conference on Computer-Aided Design, 2011

Power-driven global routing for multi-supply voltage domains.
Proceedings of the Design, Automation and Test in Europe, 2011

A Probing Algorithm for MINLP with Failure Prediction by SVM.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

Perspective reformulations of mixed integer nonlinear programs with indicator variables.
Math. Program., 2010

OR PRACTICE - R&D Project Portfolio Analysis for the Semiconductor Industry.
Oper. Res., 2010

FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs.
INFORMS J. Comput., 2010

A parallel integer programming approach to global routing.
Proceedings of the 47th Design Automation Conference, 2010

Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing.
INFORMS J. Comput., 2009

GRIP: scalable 3D global routing using integer programming.
Proceedings of the 46th Design Automation Conference, 2009

Reformulation and sampling to solve a stochastic network interdiction problem.
Networks, 2008

Combining optimization and simulation for strategic and operational industrial gas production and distribution.
Comput. Chem. Eng., 2008

Constraint Orbital Branching.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

Optimization on grids - optimization for grids.
Parallel Comput., 2006

The empirical behavior of sampling methods for stochastic programming.
Ann. Oper. Res., 2006

A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs.
Math. Program., 2005

5. Computational Grids for Stochastic Programming.
Proceedings of the Applications of Stochastic Programming, 2005

COAP 2003 Best Paper Award.
Comput. Optim. Appl., 2004

Decomposition Algorithms for Stochastic Programming on a Computational Grid.
Comput. Optim. Appl., 2003

A branch and cut approach to the cardinality constrained circuit problem.
Math. Program., 2002

Solving large quadratic assignment problems on computational grids.
Math. Program., 2002

A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems.
INFORMS J. Comput., 2001

Master-Worker: An Enabling Framework for Applications on the Computational Grid.
Clust. Comput., 2001

FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver.
Ann. Oper. Res., 2001

A Relational Modeling System for Linear and Integer Programming.
Oper. Res., 2000

An Enabling Framework for Master-Worker Applications on the Computational Grid.
Proceedings of the Ninth IEEE International Symposium on High Performance Distributed Computing, 2000

A Computational Study of Search Strategies for Mixed Integer Programming.
INFORMS J. Comput., 1999