Papers, Reports ,Presentations, and Patents

Relatively Recent Work

  1. (with Z. Abrams, S. Sathiya Keerthi and O. Mendelevitch) "Ad Delivery with Budgeted Advertisers: A Comprehensive LP Approach". Journal of Electronic Commerce Research, 9, 16-32 (2008). (pdf)
  2. (with Ralphe Wiggins) "Bid Optimization for Internet Graphical Ad Auction Systems via Special Ordered Sets", Yahoo! Research Report YR-2007-004, Presented at INFORMS International, Puerto Rico, July 2007, Available at http://arxiv.org/abs/0706.3865.
  3. (with Z. Abrams and O. Mendelevitch) "Optimal delivery of sponsored search advertisements subject to budget constraints". In Proc. ACM Conference on Electronic Commerce (EC'07), pp. 272-278, San Diego, CA. June, 2007. (pdf)
  4. (with S. Sathiya Keerthi) "Constructing a maximum utility slate of on-line advertisements", Yahoo! Research Report, YR-2007-001. Presented at INFORMS 2007, Seattle, WA. Available at http://arxiv.org/abs/0706.1318 and (pdf)
  5. (with P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright) "George B. Dantzig and Systems Optimization", Discrete Optimization 5(2), 151-158 (2008). (pdf). Also available On-line.
  6. (with J.J.H. Forrest)"Branch and Bound, Integer, and Non-Integer Programming", On-line in Annals of Operations Research, December, 2006. (pdf)
  7. (with J. Hafner et al.)"Matrix Methods for Lost Data Reconstruction in Erasure Codes", Proc. of FAST2005, San Francisco, CA (2005). (pdf)
  8. (with N. Eiron and K. McCurley)"Ranking the Web Frontier", Proceedings of the World Wide Web Conference 2004 (WWW2004), New York, pp. 309-318 , May 2004. (pdf)
  9. "A Dynamic Model of Traffic on the Web for Analyzing Network Response to Attack", Proc. Workshop on Link Analysis, Counter-Terrorism and Privacy, pp. 49-52, SIAM Intl. Conf. on Data Mining, Lake Buena Vista, FL, April, 2004. (pdf)
  10. (with S. Dill et al.)"A Case for Automated Large-Scale Semantic Annotation", J. of Web Semantics, 1, 115-132 (2003).
  11. "A New Paradigm for Ranking Pages on the World Wide Web", Procedings of the World Wide Web conference 2003 (WWW2003), pp. 350-355, Budapest, May 2003. (pdf)
  12. (with R. Fagin et al.)"Searching the Workplace Web", Procedings of the World Wide Web conference 2003 (WWW2003), pp. 366-375, Budapest, May 2003. (pdf)

Other Papers and Reports

  1. (with S. Dill et al.)"Semtag and Seeker: Bootstrapping the Semantic Web via Automated Semantic Annotation", Procedings of the World Wide Web conference 2003 (WWW2003), pp. 178-186, Budapest, May 2003. (pdf)
  2. (with A. Arasu, J. Novak and A. Tomkins), "PageRank Computation and the Structure of the Web: Experiments and Algorithms", Poster Proceedings of the World Wide Web conference 2002 (WWW2002), Hawaii, May 2002. (pdf). Long version (pdf).
  3. (with Xin Guo), "Dynamic Pricing of Internet Bandwidth via Chance Constrained Programming", IBM Almaden Research Report RJ 10196 (95070), November 2000. Presented at INFORMS International, Wailea, HI, June 2001. (pdf)
  4. (with J. Zien, J. Liu and J. Meyer), "Web Query Characteristics and Their Implications on Search Engines", IBM Almaden Research Report RJ 10199, November 2000. Poster Proceedings 10th World Wide Web conference (WWW10), Hong Kong, May 2001. (pdf) Long version (pdf).
  5. (with J. Edwards and K. McCurley), "An adaptive model for optimizing performance of an incremental web crawler", Proc. 10th World Wide Web conference (WWW10), pp. 106-113, Hong Kong, May 2001. (html)
  6. "An Entropy Approach to Unintrusive Targeted Advertising on the Web", Proc. 9th World Wide Web conference (WWW9), pp. 767-774, Amsterdam, May 2000. (html)
  7. (with A. J. Hoffman and W. R. Pulleyblank), "On Computing Ax and y'A when A is Sparse", Annals of Numerical Mathematics 4, pp. 359-367 (1997).(pdf)
  8. (with M. A. Saunders), "Solving Regularized Linear Programs Using Barrier Methods and KKT Systems", Presented at the 5th SIAM Conference on Optimization, Victoria, BC, May 1996. Stanford SOL Report 96-4, and Research Report RJ 10064, IBM Almaden Research Center, San Jose, CA, December 1996. (dvi) (pdf)
  9. (with M. A. Saunders), "Stable Reduction to KKT Systems in Barrier Methods for Linear and Quadratic Programming", Presented at the International Symposium on Optimization and Computation, Hayama, Japan, August 1966. Stanford SOL Report 96-3, and Research Report RJ 10039, IBM Almaden Research Center, San Jose, CA, August 1996. (dvi) (pdf)
  10. (with J. J. H. Forrest), "Implementing Interior Point Linear Programming Methods for the Optimization Subroutine Library." IBM Systems Journal, Volume 31, No. 1, 26-38 (1992).
  11. (with J. J. H. Forrest), "Implementing the Simplex Method for the Optimization Subroutine Library." IBM Systems Journal, Volume 31, No. 1, 11-25 (1992).
  12. (with J. S. Welch), "Mathematical Programming Systems", in Handbooks in OR and MS, vol. 3, "Computing", (E. Coffman et al., Eds.), pp. 561-601, Elsevier, The Netherlands, (1992).
  13. (with J. Edwards)"Parallel Cholesky Factorization", Proc. Fifth Australian Conference on Supercomputers, pp. 105-114, Melbourne (1992).
  14. (with J. J. H. Forrest), "Vector Processing in Simplex and Interior Methods for Linear Programming." Annals of Operations Research 22, 71-100 (1990).
  15. "The Influences of Algorithmic and Hardware Developments on Computational Mathematical Programming". Presented as the E.M.L. Beale Memorial (plenary) Lecture at the 13th International Symposium on Mathematical Programming, Tokyo, September 1988. Published in Mathematical Programming: Recent Developments and Applications, M. Iri and K. Tanabe (eds.), pp. 159 - 175, Kluwer Academic Publishers, Dordrecht, Holland (1989).
  16. "A Note on Comparing Simplex and Interior Methods for Linear Programming", in Progress in Mathematical Programming, N. Megiddo (ed.), pp. 91 - 103, Springer-Verlag, New York (1989).
  17. "Special Ordered Sets and an Application to Gas Supply Operations Planning", presented to the Beale Memorial Symposium, The Royal Society, London, July 1987. Published in Mathematical Programming 42, pp. 69 - 84 (1988). (pdf)
  18. "An Experimental Approach to Karmarkar's Projective Method for Linear Programming", Mathematical Programming Study 31, pp. 175 - 191 (1987).
  19. (with J. S. Welch), "Finding Duplicate Rows in a Linear Programming Model", Operations Research Letters 5, pp. 7-11 (1986).
  20. (with J. S. Welch), "Implementing an Interior Point Method in a Mathematical Programming System", presented to the 22nd Joint ORSA/TIMS Meeting, Miami Beach, FL, Oct. 1986. (pdf)
  21. (with P. E. Gill, W. Murray, M. A. Saunders and M. H. Wright), "On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method", Mathematical Programming 36, pp. 183-209 (1986).
  22. (with J. S. Welch), "Integration of a Primal Simplex Network Algorithm with a Large Scale Mathematical Programming System", ACM Trans. on Math. Softw. 11, pp. 1-11 (1985).
  23. (with J. S. Welch), "Formal Optimization of Some Reduced Linear Programming Problems", Mathematical Programming 27, pp. 232-240 (1983). (pdf)
  24. (with J. S. Welch), "A Pathological Case in the Reduction of Linear Programs", Operations Research Letters 2, pp. 53-57 (1983).
  25. "Large Scale Mathematical Programming Systems", Computers and Chemical Engineering 7, pp. 575-582 (1983).
  26. (with J. S. Welch), "Implementation of a Primal Simplex Network Algorithm in MPSIII", in Proceedings SHARE 60, San Francisco, California February 1983.
  27. (with J. S. Welch), "MIPIII -- A SLEUTH Based Mixed Integer Programming System", Proceedings SHARE 57, pp. 537-564, Chicago, Illinois, August 1981.
  28. "A Suggested Extension of Special Ordered Sets to Non-Separable Nonconvex Programming Problems", Studies on Graphs and Discrete Programming, P. Hansen (ed.), 359-370, North Holland, Amsterdam (1981). (pdf)
  29. (with J. Avila), "Solution of Very Large Least Squares Problems by Nested Dissection on a Parallel Processor", Proc. on Computer Science and Statistics: Twelfth Annual Symposium on the Interface, Jane F. Gentleman (ed.), pp. 9-14, Waterloo, Ontario, May 1979.
  30. "Piecewise Linear and Polynomial Approximation for Dynamic Programming and Games, Part II", TM-5753, Institute for Advanced Computation, Sunnyvale, California, February 1979.
  31. "More on Scaling Linear Complementarity Problems", Institute for Advanced Computation, Sunnyvale, California, June 1978. (pdf)
  32. "Piecewise Linear and Polynomial Approximation for Dynamic Programming and Games", TM-5613, Institute for Advanced Computation, Sunnyvale, California, April 1978.
  33. "On the Aggregation of Simultaneous Move Multi-stage Games", TM-5565, Institute for Advanced Computation, Sunnyvale, California, February 1978.
  34. "Robust Implementation of Lemke's Method for the Linear Complimentary Problem", Mathematical Programming Study 7, pp. 55-60 (1978). (pdf)
  35. (with J. K. Ho), "Hybrid Computation for Multi-Stage Linear Programs", Technical Report SOL 77-27, September 1977, Stanford University.
  36. (with H. P. Noyes and W. A. Bonner), "On the Origin of Biological Chirality via Natural Beta-Decay", Origins of Life 8, pp. 21-23 (1977).
  37. "Programmer's Guide to LCPL: Documentation for LCPL - A Program for Solving Linear Complementarity Problems by Lemke's Method", Technical Report SOL 76-25, October 1976, Stanford University.
  38. "User's Guide to LCPL - A Program for Solving Linear Complimentary Problems by Lemke's Method", Technical Report SOL 76-16, August 1976, Stanford University.
  39. (with C. E. Pfefferkorn), "Design of a Linear Programming System for the ILLIAC IV", Technical Report SOL 76-8, April 1976, Stanford University.
  40. (with Mohammad Saiidi), "Some Computational Experiments With Scolnik's Linear Programming Approach", SIGMAP Newsletter 18, pp. 30-37, February 1975.
  41. (editor), "Notes on a Workshop on Energy Systems Modelling", Technical Report SOL 75-6, April 1975, Stanford University.
  42. "An Accuracy Test for Updating Triangular Factors", Mathematical Programming Study 4, pp. 142-145 (1975).
  43. "On Scaling Linear Programming Problems", Mathematical Programming Study 4, pp. 146-166 (1975).
  44. "A Parametric Bounding Method for Finding a Minimum Norm Solution to a System of Equations", Technical Report SOL 75-12, May 1975, Stanford University.
  45. "Generalized Upper Bounds and Triangular Decomposition in the Simplex Method", Operations Research 22, pp. 664-668 (1974).
  46. "On Pricing and Backward Transformation in Linear Programming", Mathematical Programming 6, pp. 42-47 (1974).
  47. (with P.F. McCoy), "Some Experiments on the Accuracy of Three Methods of Updating the Inverse in the Simplex Method", Technical Report SOL 74-2 1, December 1974, Stanford University.
  48. (with J.J.H. Forrest and J.P.H. Hirst), "Practical Solution of Large Mixed Integer Programming Problems with UMPIRE", Management Science 20, pp. 736-773 (1974).
  49. "Computational Standards for the Mathematical Programming Society", SIGMAP Newsletter 15, pp. 22-24, November 1973. 736-774 (1974).
  50. "Survey of Computational Methods for Solving Large Scale Systems", Proc. IEEE 1972 Conference on Decision and Control, pp. 305-308 (1972).
  51. "Modifying Triangular Factors of the Basis in the Simplex Method", in Sparse Matrices and Their Applications, Rose and Willoughby, (eds.), pp. 77-85, Plenum Press, New York (1972).
  52. (with J.J.H. Forrest), "Updating Triangular Factors of the Basis to Maintain Sparsity in the Product Form Simplex Method", Mathematical Programming 2, pp. 263-278 (1972).
  53. "Maintaining a Sparse Inverse in the Simplex Method", IBM J. of Res. & Dev. 16, pp. 415-423 (1972).
  54. (with E.M.L. Beale), "An Integer Programming Approach to a Class of Combinatorial Problems", Mathematical Programming 3, pp. 339-344 (1972).
  55. "Pivoting for Sparsity and Size in Linear Programming Inversion Routines", J. Inst. Maths. Applics., 10, pp. 289-295 (1972).
  56. "An Improved Branch and Bound Method for Integer Programming", Operations Research 19, pp. 1070-1076 (1971).
  57. "A Mathematical Programming Model for the Combined Distribution- Assignment of Traffic". Transportation Science 5, pp. 122-140 (1971).
  58. "Branch and Bound Methods for Integer and Non-Convex Programming", in Integer and Non-Linear Programming, J. Abadie (ed.), North-Holland 1970.
  59. (with E. M. L. Beale), "Special Facilities in General Mathematical Programming System for Non-Convex Problems Using Ordered Sets of Variables", Proc. 5th IFORS Conference, pp. 447-454, J. R. Lawrence (ed.), Tavistock, London & Wiley, New York (1970). (pdf)
  60. "Generalized Cuts in Mixed Integer Programming", Working paper, Scientific Control Systems Ltd., December 1969.
  61. (with S. G. Tomlin), "Traffic Distribution and Entropy", Nature 220, pp. 974-976 (1968).
  62. Mathematical Programming Models for Traffic Network Problems, Thesis, University of Adelaide, December 1967.
  63. "A Linear Programming Model for the Assignment of Traffic", Proc. A.R.R.B. 3rd Conference, Part 1, pp. 263-271 (1966).
  64. (with D. J. Buckley and W. E. Minson), "Delays to Traffic Platoons", Proc. A.R.R.B. 3rd Conference, Part 1, pp. 364-376 (1966).
  65. "Minimum-Cost Multicommodity Network Flows", Operations Research 14, pp. 45-51 (1966).

Some Other Conference Presentations

  1. "A Kinetic Model of Traffic on the World Wide Web", Presented at the CORS-INFORMS Joint Meeting, Banff, Alberta, May 2004.
  2. (with J. Edwards)"A Parallel Algorithm for Ranking Pages on the World Wide Web", Presented at the CORS-INFORMS Joint Meeting, Banff, Alberta, May 2004.
  3. (with M. A. Saunders), "Interior-point solution of large-scale entropy maximization problems", presented at 18th International Symposium on Mathematical Programming, Copenhagen, Denmark, August 18-22, 2003. (pdf)
  4. "Traffic, Entropy and the Web", Presented at the INFORMS Annual Meeting, San Jose, CA, November 17-20, 2002.
  5. "Solution of Some Very Large Nonlinear Network Optimization Problems", Presented at the SIAM Conference on Optimization, Toronto, May 20-22, 2002.
  6. "Implementation of a Filter Algorithm for Regularized SQP Solution of Nonlinear Programs", 6th SIAM Conference on Optimization, Atlanta, GA, May 10-12, 1999.
  7. (with D.L. Jensen)"Web-Based Tools for the Optimization Subroutine Library", 16th International Symposium on Mathematical Programming, Lausanne, August 1997.
  8. (co-organizer and presenter)"OR and the Web", Panel discussion at 14th Triennial Conference of the International Federation of Operational Research Societies, Vancouver, BC, Canada, July 8-12, 1996
  9. (with H.P. Crowder),"Corn, Weeds and Linear Programming", 37th Joint ORSA/TIMS Meeting, Detroit, MI, October 1994.
  10. "Load Balancing of a Scalable Parallel Implementation of Stochastic Programming with Importance Sampling", 15th International Symposium on Mathematical Programming, Ann Arbor, MI, August 1994.
  11. (with J.J. Edwards)"Parallel Mathematical Programming", TIMS XXXII, Anchorage , AL, 1994.
  12. "Scalable Parallel Solution of Structured Linear Programs", 4th INFORMS Computer Science Technical Section Conference on The Impact of Emerging Technologies on Computer Science and Operations Research, Wialliamsberg, VA, January 1994.
  13. (with J.J.H. Forrest), "Use of the Optimization Subroutine Library on Parallel Work Stations", 35th Joint ORSA/TIMS Meeting, Chicago, IL, May 1993.
  14. (with J.J. Edwards)"A Highly Parallel Mathematical Programming System", 14th International Mathematical Programming Symposium, Amsterdam, 1991.
  15. (with J.J. Edwards)"Towards a Highly Parallel Mathematical Programming System", 31st TIMS/ORSA Joint National Meeting, Nashville, TN, 1991
  16. (with J.J.H. Forrest), "Mathematical Programming with a Library of Optimization Subroutines", 28th Joint ORSA/TIMS Meeting, New York, NY, October 1989.
  17. (with H.P. Crowder),"Parallel and Vector Computing in Mathematical programming: An Introduction", 27th Joint ORSA/TIMS Meeting, Vancouver, BC, May 1989.
  18. (with J.J.H. Forrest),"Vector and Parallel Mathematical Programming with the IBM 3090 Vector Facility", 27th Joint ORSA/TIMS Meeting, Vancouver, BC, May 1989.
  19. (with J. S. Welch), "Solving Generalized Network Models in a General Purpose Mathematical Programming System", 18th Joint ORSA/TIMS Meeting, Dallas, TX, Nov. 1984.

Patents Issued

(Several others are in the pipeline)
  1. (with R. Fagin, et al) "System, method and service for ranking search results using a modular scoring system". Patent Number 7257577, Aug 14, 2007.
  2. (with N. Eiron ans K.S. McCurley) "System and method for ranking nodes in a network", Patent Number 7251654, July 31, 2007.
  3. (with A. Arasu and A.S. Tomkins) "System and method for rapid computation of Pagerank", Patent Number 7089252, Aug 8, 2006.
  4. (with J.L. Hafner) "System and method for minimizing energy consumption in hybrid vehicles", Patent Number 7013205, Mar 14, 2006.
  5. (with J.J. Forrest and N. Megiddo) "Method for solving a large sparse triangular system of linear equations", Patent Number 6694343, Feb 17, 2004.
  6. (with A.J. Hoffman and W.R. Pulleyblank) "Processing system and method for performing sparse matrix multiplication by reordering vector blocks", Patent Number 5905666, May 18, 1999.
  7. (with J.L. Hafner and L.L. Williams) "System and method for memory management in an array of heat producing devices to prevent local overheating", Patent Number 5787462, July 28, 1998.
  8. (with J.L. Hafner and L.L. Williams) "System and method for packing heat producing devices in an array to prevent local overheating", Patent Number 5530658, June 25, 1996. 

[Home Page]  [List]
Last modified: 20 Aug 07  /  tomlin@yahoo-inc.com