Skip to main content
Jeffrey Linderoth

Jeffrey Linderoth

Harvey D. Spangler Professor
gscholar website
lab website

Professor Linderoth’s research focuses on modeling and solving real-world, large-scale optimization problems. Specific research areas within optimization include integer programming, used for modeling yes/no decisions, and stochastic programming, useful for decision making under uncertainty.His research places a particular emphasis on developing high-performance, distributed optimization algorithms and software.

Department

Industrial & Systems Engineering

Contact

3107C, Mechanical Engineering Bldg
1513 University Ave
Madison, WI
p: (608) 890-1931

  • PhD 1998, Georgia Institute of Technology
  • MS 1994, Georgia Institute of Technology
  • BS 1992, University of Illinois at Urbana-Champaign

  • High Performance and Grid Computing
  • Numerical Optimization: Integer programming and Stochastic programming

  • 2024 INFORMS Journal on Computing , Featured Paper, January-February issue
  • 2023 United States Navy, Appreciation Medal
  • 2021 Mathematical Programming Computation, Best paper award
  • 2021 College of Engineering, Univ. of Wisconsin-Madison, David Gustafson Department Chair
  • 2019 University Housing, University of Wisconsin-Madison, Honored Instructor Award
  • 2018 College of Engineering, University of Wisconsin-Madison, Harvey D. Spangler Professorship
  • 2018 Mathematical Programming Computation, Honorable Mention, best paper 2018
  • 2016 INFORMS , Elected Fellow
  • 2016 University Housing, University of Wisconsin-Madison, Honored Instructor Award
  • 2014 INFORMS Computing Society, ICS Prize
  • 2014 Computational Optimization and Applications , Runner-up, best paper 2014
  • 2012 Conference on High-Performance and Distributed Computing, Recognition for one of 22 most influential papers
  • 2011 Polygon Engineering Council, University of Wisconsin-Madison, Outstanding Instructor, ISyE
  • 2010 47th Design Automation Conference, Honorable Mention, Best paper
  • 2009 Polygon Engineering Council, University of Wisconsin-Madison, Outstanding Instructor, ISyE
  • 2008 University Housing, University of Wisconsin-Madison, Honored Instructor Award
  • 2006 Lehigh University, Eleanor & Joseph F. Libsch Early Career Research Award
  • 2005 U.S. Department of Energy, Early Career Principal Investigator Award: Applied Mathematics, Computer Science, and High-Performance Networks
  • 2005 IBM , Faculty Partnership Award
  • 2005 Engineering, Lehigh University, Ingenuity Award for Exceptional Accomplishment in Teaching and/or Research by a Junior Faculty Member
  • 2003 Computational Optimization and Applications, Best Paper Award 2003
  • 2002 SIAM , Activity Group on Optimization Prize
  • 2000 Ninth IEEE International Symposium on High Performance Distributed Computing, Outstanding paper award
  • 1999 Argonne National Lab, Enrico Fermi Scholar

  • Ma, Z., Linderoth, J., & Bienstock, D. (2024). Branching in the Dual Decomposition Method for Stochastic Integer Programs. In Proceedings of the INFORMS Optimization Society Conference. INFORMS.
  • Sawkmie, V., Linderoth, J., & Bienstock, D. (2024). Flexible Resource Job Scheduling---A Mixed Integer Programming Approach. In Proceedings of the INFORMS Optimization Society Conference. INFORMS.
  • Michini, C., Ohmann, P., Libit, B., & Linderoth, J. (2024). A Set Covering Approach to Customized Coverage Instrumentation. INFORMS Journal on Computing, 36(1), 21-38.
  • Del Pia, A., Linderoth, J., & Zhu, H. (2024). New Classes of Facets for Complementarity Knapsack Problems. Discrete Applied Mathematics https://doi.org/10.1016/j.dam.2024.05.041
  • Raghunathan, A., & Linderoth, J. (2024). Stability Analysis of Discrete-Time Linear Complementarity Systems. SIAM Journal on Optimization.
  • Del Pia, A., Linderoth, J., & Zhu, H. (2023). Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets. Mathematical Programming, Series B, 197, 847-875 https://doi.org/https://doi.org/10.1007/s10107-022-01817-4
  • Del Pia, A., Linderoth, J., & Zhu, H. (2023). On the Complexity of Separating Cutting Planes for the Knapsack Polytope. Mathematical Programming, Series B https://doi.org/https://doi.org/10.1007/s10107-023-01963-3
  • Del Pia, A., Linderoth, J., Zhu, H., I. Ljub'ic,, F> Barahona,, Dey, S., & Mahjoub, A. R. (2022). New Classes of Facets for Complementarity Knapsack Problems. In ISCO 2022: The 7th International Symposium on Combinatorial Optimization, Lecture Notes in Computer Science (p. 3-22). Springer.
  • Peng, Z., Baum, D., & Linderoth, J. (2022). The Hierarchical Organization of Autocatalytic Reaction Networks and its Relevance to Origin of Life. PLOS Computational Biology https://doi.org/https://doi.org/10.1371/journal.pcbi.1010498
  • Soni, A., Linderoth, J., Luedtke, J., & D. Pimentel-Alarc'on, (2021). Integer Programming Approaches to Subspace Clustering with Missing Data. In OPT2021, 13th Annual Workshop on Optimization for Machine Learning.

  • COMP SCI 524 - Introduction to Optimization (Spring 2025)
  • E C E 524 - Introduction to Optimization (Spring 2025)
  • I SY E 524 - Introduction to Optimization (Spring 2025)
  • I SY E 890 - Pre-Dissertator's Research (Spring 2025)
  • I SY E 890 - Pre-Dissertator's Research (Fall 2024)
  • I SY E 890 - Pre-Dissertator's Research (Summer 2024)
  • I SY E 990 - Research and Thesis (Summer 2024)
  • COMP SCI 524 - Introduction to Optimization (Spring 2024)
  • E C E 524 - Introduction to Optimization (Spring 2024)
  • I SY E 524 - Introduction to Optimization (Spring 2024)
  • I SY E 890 - Pre-Dissertator's Research (Spring 2024)
  • I SY E 990 - Research and Thesis (Spring 2024)
  • I SY E 890 - Pre-Dissertator's Research (Fall 2023)
  • I SY E 890 - Pre-Dissertator's Research (Summer 2023)
  • I SY E 990 - Research and Thesis (Summer 2023)