Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeff T. Linderoth
Person information
- affiliation: University of Wisconsin-Madison, Department of Industrial and Systems Engineering, WI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j48]Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
:
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation. Math. Program. 197(2): 847-875 (2023)- 2022
- [j47]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): 1010498 (2022) - 2021
- [j46]Cong Han Lim, Jeffrey T. Linderoth, James R. Luedtke, Stephen J. Wright:
Parallelizing Subgradient Methods for the Lagrangian Dual in Stochastic Mixed-Integer Programming. INFORMS J. Optim. 3(1): 1-22 (2021) - [j45]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): 139-153 (2021) - [j44]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): 301-338 (2021) - [j43]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): 443-490 (2021) - [j42]Kaarthik Sundar, Harsha Nagarajan, Jeff T. Linderoth, Site Wang, Russell Bent:
Piecewise polyhedral formulations for a multilinear term. Oper. Res. Lett. 49(1): 144-149 (2021) - [j41]Alberto Del Pia, Dion Gijswijt, Jeff T. Linderoth, Haoran Zhu:
Integer packing sets form a well-quasi-ordering. Oper. Res. Lett. 49(2): 226-230 (2021) - 2020
- [j40]James R. Luedtke, Claudia D'Ambrosio, Jeff T. Linderoth, Jonas Schweiger:
Strong Convex Nonlinear Relaxations of the Pooling Problem. SIAM J. Optim. 30(2): 1582-1609 (2020) - 2018
- [j39]Cong Han Lim, Jeff T. Linderoth, James R. Luedtke:
Valid inequalities for separable concave constraints with indicator variables. Math. Program. 172(1-2): 415-442 (2018) - [j38]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): 333-382 (2018) - [j37]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): 1312-1336 (2018) - 2017
- [j36]Golnaz Arastoopour Irgens, Naomi C. Chesler, Jeffrey T. Linderoth, David Williamson Shaffer:
Data-enabled cognitive modeling: Validating student engineers' fuzzy design-based decision-making in a virtual design problem. Comput. Appl. Eng. Educ. 25(6): 1001-1017 (2017) - [j35]Hyemin Jeon, Jeff T. Linderoth, Andrew Miller:
Quadratic cone cutting surfaces for quadratic programs with on-off constraints. Discret. Optim. 24: 32-50 (2017) - [j34]Mustafa R. Kilinç, Jeff T. Linderoth, James R. Luedtke:
Lift-and-project cuts for convex mixed integer nonlinear programs. Math. Program. Comput. 9(4): 499-526 (2017) - [j33]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): 1427-1435 (2017) - 2016
- [j32]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): 922-938 (2016) - [j31]Shabbir Ahmed, Jeff T. Linderoth:
Special issue on "Integer programming under uncertainty". Math. Program. 157(1): 1-2 (2016) - 2015
- [j30]Oguzhan Alagöz, Mehmet U. S. Ayvaci, Jeffrey T. Linderoth:
Optimally solving Markov decision processes with total expected discounted reward function: Linear programming revisited. Comput. Ind. Eng. 87: 311-316 (2015) - 2014
- [j29]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): 639-665 (2014) - [j28]Srikrishna Sridhar, Jeffrey T. Linderoth, James R. Luedtke:
Models and solution techniques for production planning problems with increasing byproducts. J. Glob. Optim. 59(2-3): 597-631 (2014) - 2013
- [j27]Pietro Belotti, Christian Kirches, Sven Leyffer, Jeff T. Linderoth, James R. Luedtke, Ashutosh Mahajan:
Mixed-integer nonlinear optimization. Acta Numer. 22: 1-131 (2013) - [j26]Srikrishna Sridhar, Jeff T. Linderoth, James R. Luedtke:
Locally ideal formulations for piecewise linear functions with indicator variables. Oper. Res. Lett. 41(6): 627-632 (2013) - [j25]Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth:
Power-Driven Global Routing for Multisupply Voltage Domains. VLSI Design 2013: 905493:1-905493:12 (2013) - 2012
- [j24]Michael Freimer, Jeffrey T. Linderoth, Douglas J. Thomas:
The impact of sampling methods on bias and variance in stochastic linear programs. Comput. Optim. Appl. 51(1): 51-75 (2012) - [j23]James R. Luedtke, Mahdi Namazifar, Jeff T. Linderoth:
Some results on the strength of relaxations of multilinear functions. Math. Program. 136(2): 325-351 (2012) - 2011
- [j22]Mine Altunay, Sven Leyffer, Jeffrey T. Linderoth, Zhen Xie:
Optimal response to attacks on the open science grid. Comput. Networks 55(1): 61-73 (2011) - [j21]James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio:
Orbital branching. Math. Program. 126(1): 147-178 (2011) - [j20]James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio:
Solving large Steiner Triple Covering Problems. Oper. Res. Lett. 39(2): 127-131 (2011) - [j19]Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth:
GRIP: Global Routing via Integer Programming. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 30(1): 72-84 (2011) - 2010
- [j18]Kumar Abhishek, Sven Leyffer, Jeff T. Linderoth:
FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs. INFORMS J. Comput. 22(4): 555-567 (2010) - [j17]Banu Gemici-Ozkan, S. David Wu, Jeffrey T. Linderoth, Jeffry E. Moore:
OR PRACTICE - R&D Project Portfolio Analysis for the Semiconductor Industry. Oper. Res. 58(6): 1548-1563 (2010) - [j16]Oktay Günlük, Jeff T. Linderoth:
Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124(1-2): 183-205 (2010) - 2009
- [j15]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): 445-457 (2009) - 2008
- [j14]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): 2536-2546 (2008) - [j13]Udom Janjarassuk, Jeff T. Linderoth:
Reformulation and sampling to solve a stochastic network interdiction problem. Networks 52(3): 120-132 (2008) - 2006
- [j12]Jeff T. Linderoth, Alexander Shapiro, Stephen J. Wright:
The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142(1): 215-241 (2006) - [j11]Jeff T. Linderoth, Roberto Musmanno:
Optimization on grids - optimization for grids. Parallel Comput. 32(9): 627-628 (2006) - 2005
- [j10]Jeff T. Linderoth:
A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Program. 103(2): 251-282 (2005) - 2004
- [j9]Jeff T. Linderoth, Steven J. Wright:
COAP 2003 Best Paper Award. Comput. Optim. Appl. 29(2): 123-126 (2004) - 2003
- [j8]Jeff T. Linderoth, Stephen J. Wright:
Decomposition Algorithms for Stochastic Programming on a Computational Grid. Comput. Optim. Appl. 24(2-3): 207-250 (2003) - 2002
- [j7]Petra Bauer, Jeff T. Linderoth, Martin W. P. Savelsbergh:
A branch and cut approach to the cardinality constrained circuit problem. Math. Program. 91(2): 307-348 (2002) - [j6]Kurt M. Anstreicher, Nathan W. Brixius, Jean-Pierre Goux, Jeff T. Linderoth:
Solving large quadratic assignment problems on computational grids. Math. Program. 91(3): 563-588 (2002) - 2001
- [j5]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): 17-32 (2001) - [j4]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): 63-70 (2001) - [j3]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): 191-209 (2001) - 2000
- [j2]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): 846-857 (2000) - 1999
- [j1]Jeff T. Linderoth, Martin W. P. Savelsbergh:
A Computational Study of Search Strategies for Mixed Integer Programming. INFORMS J. Comput. 11(2): 173-187 (1999)
Conference and Workshop Papers
- 2022
- [c19]Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
On the Complexity of Separation from the Knapsack Polytope. IPCO 2022: 168-180 - [c18]Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
New Classes of Facets for Complementarity Knapsack Problems. ISCO 2022: 3-21 - 2021
- [c17]Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets. IPCO 2021: 193-207 - 2020
- [c16]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: 91-105 - 2016
- [c15]Daohang Shi, Azadeh Davoodi, Jeffrey T. Linderoth:
A procedure for improving the distribution of congestion in global routing. DATE 2016: 249-252 - [c14]Cong Han Lim, Jeff T. Linderoth, James R. Luedtke:
Valid Inequalities for Separable Concave Constraints with Indicator Variables. IPCO 2016: 275-286 - [c13]Peter Ohmann, David Bingham Brown, Naveen Neelakandan, Jeff T. Linderoth, Ben Liblit:
Optimizing customized program coverage. ASE 2016: 27-38 - 2013
- [c12]Hongbo Dong, Jeff T. Linderoth:
On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators. IPCO 2013: 169-180 - [c11]Hamid Shojaei, Azadeh Davoodi, Jeffrey T. Linderoth:
Planning for local net congestion in global routing. ISPD 2013: 85-92 - 2011
- [c10]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: 154-169 - [c9]Tai-Hsuan Wu, Azadeh Davoodi, Jeff T. Linderoth:
Power-driven global routing for multi-supply voltage domains. DATE 2011: 443-448 - [c8]Hamid Shojaei, Azadeh Davoodi, Jeffrey T. Linderoth:
Congestion analysis for global routing via integer programming. ICCAD 2011: 256-262 - [c7]Claudia D'Ambrosio, Jeff T. Linderoth, James R. Luedtke:
Valid Inequalities for the Pooling Problem with Binary Variables. IPCO 2011: 117-129 - 2010
- [c6]Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth:
A parallel integer programming approach to global routing. DAC 2010: 194-199 - 2009
- [c5]Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth:
GRIP: scalable 3D global routing using integer programming. DAC 2009: 320-325 - 2008
- [c4]Oktay Günlük, Jeff T. Linderoth:
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables. IPCO 2008: 1-16 - [c3]James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio:
Constraint Orbital Branching. IPCO 2008: 225-239 - 2007
- [c2]James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio:
Orbital Branching. IPCO 2007: 104-118 - 2000
- [c1]Jean-Pierre Goux, Sanjeev Kulkarni, Jeff T. Linderoth, Michael Yoder:
An Enabling Framework for Master-Worker Applications on the Computational Grid. HPDC 2000: 43-50
Parts in Books or Collections
- 2005
- [p1]Jeff T. Linderoth, Stephen J. Wright:
5. Computational Grids for Stochastic Programming. Applications of Stochastic Programming 2005: 61-77
Informal and Other Publications
- 2020
- [i3]Kaarthik Sundar, Harsha Nagarajan, Site Wang, Jeff T. Linderoth, Russell Bent:
Piecewise Polyhedral Formulations for a Multilinear Term. CoRR abs/2001.00514 (2020) - 2018
- [i2]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): 64-87 (2018) - 2015
- [i1]Hongbo Dong, Kun Chen, Jeff T. Linderoth:
Regularization vs. Relaxation: A conic optimization perspective of statistical variable selection. CoRR abs/1510.06083 (2015)
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-05-09 00:02 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:
