Publications of Jeff Linderoth

Many of these publications can be found at the excellent site Optimization Online.
I highly recommend that all optimization researchers submit their preprints to Optimization Online.

The papers here are generally (earlier) tech report versions of papers that appeared in print and over which I do not hold he explicit copyright. Please contact me if you would like a copy of a paper not appearing here.

Journal Articles

snip.pdf: U. Janjarassuk and Jeff Linderoth, "Reformulation and Sampling to Solve a Stochastic Network Interdiction Problem", Networks, To appear, 2007.
emp-study.ps.gz emp-study.pdf: J. T. Linderoth, A. Shapiro, and S. J. Wright, ``The Empirical Behavior of Sampling Methods for Stochastic Programming'', Annals of Operations Research, 142 (2006), pp. 219-245.
qcqp.ps.gz qcqp.pdf: J. T. Linderoth, ``A Simplicial Branch-and-Bound Algorithm for Solving Quadratically Constrained Quadratic Programs'', Mathematical Programming, Series B, 103 (2005), pp. 251-282.
atr.ps.gz atr.pdf: J. T. Linderoth and S. J. Wright, "Decomposition Algorithms for Stochastic Programming on a Computational Grid," Computational Optimization and Applications, 24 (2003), pp. 207-250.
QAP-GRID.ps.gz QAP-GRID.pdf: K. Anstreicher and N. Brixius and J.-P. Goux and J. T. Linderoth, "Solving Large Quadratic Assignment Problems on Computational Grids," Mathematical Programming, Series B, 91 (2002), pp. 563-588.
CCCP.ps.gz CCCP.pdf: P. Bauer, J. T. Linderoth, and M. W. P. Savelsbergh, "A Branch and Cut Approach to the Cardinality Constrained Circuit Problem," Mathematical Programming, 91 (2002), pp. 307-348.
PSP.ps.gz PSP.pdf: J. T. Linderoth, E. K. Lee, and M. W. P. Savelsbergh, "A Parallel, Linear Programming Based Heuristic for Large Scale Set Partitioning Problems," INFORMS Journal on Computing, 13 (2001), pp. 191-209.
MW.ps.gz MW.pdf: J.-P Goux, S. Kulkarni, J. T. Linderoth, and M. E. Yoder, ``Master-Worker: An Enabling Framework for Applications on the Computational Grid'', Cluster Computing 4 (2001), pp. 63-70.
FATCOP.ps.gz FATCOP.pdf: Q. Chen, M. Ferris, and J. T. Linderoth, "FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver," Annals of Operations Research 103 (2001), pp. 17-32.
ARMOS.ps.gz ARMOS.pdf: A. Atamturk, E. L. Johnson, J. T. Linderoth and M. W. P. Savelsbergh, "A Relational Modeling System for Linear and Integer Programming," Operations Research, 48 (2000), pp.846-857.
BRANCH.ps.gz BRANCH.pdf: J. T. Linderoth and M. W. P. Savelsbergh, "A Computational Study of Branch and Bound Search Strategies for Mixed Integer Programming," INFORMS Journal on Computing, 11 (1999) pp. 173-187.

Book Chapters

MW-Knapsack.pdf: W. Glankwamdee and J. T. Linderoth, ``MW: A Software Framework for Combinatorial Optimization on Computational Grids,'' E. Talbi, (ed). Parallel Combinatorial Optimization, John Wiley & Sons, forthcoming, 2006.
MILP04.pdf: J. T. Linderoth and T. K. Ralphs, ``Noncommercial Software for Mixed-Integer Linear Programming'', J. Karlof (ed). Integer Programming: Theory and Practice, CRC Press Operations Research Series, 2005, 253-303.; J. T. Linderoth and S. J. Wright, ``Computational Grids for Stochastic Programming,'' S. Wallace and W. Ziemba (eds). Applications of Stochastic Programming, SIAM Mathematical Series on Optimization, 2005, 61-77.

Technical Reports

tg-football.pdf: Jeff Linderoth, Francois Margot, and Greg Thain, "The Tera-Gridiron: A Natural Turf for High-Throughput Computing," Technical Report 07T-001, Industrial and Systems Engineering, Lehigh University, 2007.
SVRP.pdf: Clara Novoa, Rosemary Berger, Jeff Linderoth, and Robert Storer, "A Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem", Technical Report 06T-008, Industrial and Systems Engineering, Lehigh University, 2006.
lookahead.pdf: Wasu Glankwamdee and Jeff Linderoth, "Lookahead Branching for Mixed Integer Programming", Technical Report 06T-004, Industrial and Systems Engineering, Lehigh University, 2006.
SP-Anti.pdf: M. Freimer, D. Thomas and J. T. Linderoth, "Reducing Bias in Stochastic Linear Programming with Sampling Methods", Technical Report 05T-002, Industrial and Systems Engineering, Lehigh University, 2005.
MW-background.ps.gz MW-background.pdf: J.-P Goux, J. T. Linderoth, and M. E. Yoder, "Metacomputing and the Master-Worker Paradigm," Preprint ANL/MCS-P792-0200, Mathematics and Computer Science Division, Argonne National Laboratory, 2000.
BRANCH-full.ps.gz BRANCH-full.pdf: J. T. Linderoth and M. W. P. Savelsbergh, "A Computational Study of Search Strategies for Mixed Integer Programming," Report LEC-97-12, Georgia Institute of Technology, 1997.; J. T. Linderoth and S. A. Burns, "Performance of Simulated Annealing as a Circuit Placement Optimization Method," UIUC Department of General Engineering Report 91-04, UIL U-ENG-91-3206, 1991.

Refereed Conference Proceedings

Orbital-Branch.pdf: James Ostrowski, Jeff Linderoth, Fabrizio Rossi, and Stefano Smirglio, "Orbital Branching", IPCO 2007: The Twelfth Conference on Integer Programming and Combinatorial Optimization, to appear, 2007.
MW-HPDC.ps.gz MW-HPDC.pdf: J.-P Goux, S. Kulkarni, J. T. Linderoth, and M. E. Yoder, "An Enabling Framework for Master-Worker Applications on the Computational Grid," Proceedings of the Ninth IEEE International Symposium on High Performance Distributed Computing, 2000.

Other Publications

CCCP-facet.ps.gz CCCP-facet.pdf: P. Bauer, J. T. Linderoth, and M. W. P. Savelsbergh, "Facets of the Cardinality Constrained Circuit Polytope," Optimization Online: http://www.optimization-online.org/DB_HTML/2001/07/356.html.
THESIS.ps.gz THESIS.pdf: J. T. Linderoth, Topics in Parallel Integer Optimization, PhD Thesis, Georgia Institute of Technology, 1998.
EKK.ps.gz EKK.pdf: L. Clarke, J. T. Linderoth, E. L. Johnson, G. L. Nemhauser, R. Bhagavan, and M. Jordan, "Using OSL to Improve the Computational Results of a MIP Logistics Model," EKKNEWS, 16 (1995).