Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jeff T. Linderoth
Jeffrey T. Linderoth – Jeff Linderoth
2010 – today
- 2013
[c12]Hongbo Dong, Jeff 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- 2012
[j21]Michael Freimer, Jeffrey T. Linderoth, Douglas J. Thomas: The impact of sampling methods on bias and variance in stochastic linear programs. Comp. Opt. and Appl. 51(1): 51-75 (2012)
[j20]James Luedtke, Mahdi Namazifar, Jeff Linderoth: Some results on the strength of relaxations of multilinear functions. Math. Program. 136(2): 325-351 (2012)- 2011
[j19]Mine Altunay, Sven Leyffer, Jeffrey T. Linderoth, Zhen Xie: Optimal response to attacks on the open science grid. Computer Networks 55(1): 61-73 (2011)
[j18]James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio: Orbital branching. Math. Program. 126(1): 147-178 (2011)
[j17]James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio: Solving large Steiner Triple Covering Problems. Oper. Res. Lett. 39(2): 127-131 (2011)
[j16]Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth: GRIP: Global Routing via Integer Programming. IEEE Trans. on CAD of Integrated Circuits and Systems 30(1): 72-84 (2011)
[c10]Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff 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 Linderoth, James Luedtke: Valid Inequalities for the Pooling Problem with Binary Variables. IPCO 2011: 117-129- 2010
[j15]Kumar Abhishek, Sven Leyffer, Jeff Linderoth: FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs. INFORMS Journal on Computing 22(4): 555-567 (2010)
[j14]Banu Gemici-Ozkan, S. David Wu, Jeffrey T. Linderoth, Jeffry E. Moore: OR PRACTICE - R&D Project Portfolio Analysis for the Semiconductor Industry. Operations Research 58(6): 1548-1563 (2010)
[j13]Oktay Günlük, Jeff Linderoth: Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124(1-2): 183-205 (2010)
[c6]Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth: A parallel integer programming approach to global routing. DAC 2010: 194-199
2000 – 2009
- 2009
[j12]Jeff Linderoth, François Margot, Greg Thain: Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing. INFORMS Journal on Computing 21(3): 445-457 (2009)
[c5]Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth: GRIP: scalable 3D global routing using integer programming. DAC 2009: 320-325- 2008
[j11]Wasu Glankwamdee, Jeff T. Linderoth, Jierui Shen, Peter Connard, Jim Hutton: Combining optimization and simulation for strategic and operational industrial gas production and distribution. Computers & Chemical Engineering 32(11): 2536-2546 (2008)
[j10]Udom Janjarassuk, Jeff Linderoth: Reformulation and sampling to solve a stochastic network interdiction problem. Networks 52(3): 120-132 (2008)
[c4]Oktay Günlük, Jeff Linderoth: Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables. IPCO 2008: 1-16
[c3]James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio: Constraint Orbital Branching. IPCO 2008: 225-239- 2007
[c2]James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio: Orbital Branching. IPCO 2007: 104-118- 2006
[j9]Jeff Linderoth, Alexander Shapiro, Stephen Wright: The empirical behavior of sampling methods for stochastic programming. Annals OR 142(1): 215-241 (2006)
[j8]Jeff Linderoth, Roberto Musmanno: Optimization on grids - optimization for grids. Parallel Computing 32(9): 627-628 (2006)- 2005
[j7]Jeff Linderoth: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Program. 103(2): 251-282 (2005)- 2004
[j6]Jeff Linderoth, Steve Wright: COAP 2003 Best Paper Award. Comp. Opt. and Appl. 29(2): 123-126 (2004)- 2003
[j5]Jeff Linderoth, Stephen Wright: Decomposition Algorithms for Stochastic Programming on a Computational Grid. Comp. Opt. and Appl. 24(2-3): 207-250 (2003)- 2001
[j4]Qun Chen, Michael C. Ferris, Jeff Linderoth: FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver. Annals OR 103(1-4): 17-32 (2001)
[j3]Jean-Pierre Goux, Sanjeev Kulkarni, Michael Yoder, Jeff Linderoth: Master-Worker: An Enabling Framework for Applications on the Computational Grid. Cluster Computing 4(1): 63-70 (2001)
[j2]Jeff T. Linderoth, Eva K. Lee, Martin W. P. Savelsbergh: A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems. INFORMS Journal on Computing 13(3): 191-209 (2001)- 2000
[c1]Jean-Pierre Goux, Sanjeev Kulkarni, Jeff Linderoth, Michael Yoder: An Enabling Framework for Master-Worker Applications on the Computational Grid. HPDC 2000: 43-50
1990 – 1999
- 1999
[j1]Jeff T. Linderoth, Martin W. P. Savelsbergh: A Computational Study of Search Strategies for Mixed Integer Programming. INFORMS Journal on Computing 11(2): 173-187 (1999)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-10 22:31 CEST by the dblp team



