Publications

2009

2008

  • Z. Akca, R. Berger, and T.K.R., Modeling and Solving Location, Routing, and Scheduling Problems, COR@L Laboratory Technical Report (2008) (PDF)
  • M. Guzelsoy and T.K.R., The Value Function of a Mixed-Integer Linear Program with a Single Constraint, COR@L Laboratory Technical Report (2008) (PDF)
  • T.K.R., SYMPHONY Version 5.1 User’s Manual, COR@L Laboratory Technical Report (2008) (PDF).

2007

  • M. Guzelsoy and T.K.R., Duality for Mixed-Integer Linear Programs, The International Journal of Operations Research 4 (2007), 118-137 (Working paper version: PS PDF).
  • O. Osaltyn, B. Hunsaker, and T.K.R., Visualizing Branch-and-Bound Algorithms, COR@L Laboratory Technical Report (2007) (PDF).
  • Y. Xu, T.K.R., L. Ladányi, and M.J. Saltzman, Computational Experience with a Software Framework for Parallel Integer Programming, COR@L Laboratory Technical Report (2007) (PDF).

2006

2005

  • J.T. Linderoth and T.K.R., Noncommercial Software for Mixed-Integer Linear Programming, in Integer Programming: Theory and Practice, John Karlof, ed. (2005), 253-303 (Working paper version: PS PDF).
  • T.K.R. and M. Galati, Decomposition in Integer Programming, in Integer Programming: Theory and Practice, John Karlof, ed. (2005), 57 (Working paper version: PS PDF).
  • T.K.R. and M. Guzelsoy, The SYMPHONY Callable Library for Mixed Integer Programming, The Proceedings of the Ninth INFORMS Computing Society Conference (2005), 61-76 (Working paper version: PS PDF).
  • Y. Xu, T.K.R., L. Ladányi, and M.J. Saltzman, ALPS: A Framework for Implementing Parallel Search Algorithms, The Proceedings of the Ninth INFORMS Computing Society Conference (2005), 319-334 (Working paper version: PS PDF).

2004

  • T.K.R., L. Ladányi, and M.J. Saltzman, A Library Hierarchy for Implementing Scalable Parallel Search Algorithms, The Journal of Supercomputing 28 (2004), 215-234 (Working paper version: PS PDF).
  • T.K.R. and M. Guzelsoy, Duality, Warm Starting, and Sensitivity Analysis in Integer Programming, Lehigh University Industrial and Systems Engineering Technical Report 04T-021 (2004) (Available by request).
  • R. Lougee-Heimer, M. Saltzman, and T.K.R., ‘COIN’ of the OR Realm, OR/MS Today, October 2004.
  • T.K.R., SYMPHONY Version 5.0 User’s Manual, Lehigh University Industrial and Systems Engineering Technical Report 04T-020 (2004) (PS PDF).
  • T.K.R., M.J. Saltzman, and M.M. Wiecek, An Improved Algorithm for Biobjective Integer Programming and Its Application to Network Routing Problems, Lehigh University Industrial and Systems Engineering Technical Report 04T-004 (2004) (PS PDF).

2003

  • T.K.R., L. Ladányi, and M.J. Saltzman, Parallel Branch, Cut, and Price for Large-scale Discrete Optimization, Mathematical Programming 98 (2003), 253-280 (Working paper version: PS PDF).
  • T.K.R., Parallel Branch and Cut for Capacitated Vehicle Routing, Parallel Computing 29 (2003), 607-629 (Working paper version: PS PDF).
  • T.K.R., L. Kopman, W.R. Pulleyblank, and L.E. Trotter Jr., On the Capacitated Vehicle Routing Problem, Mathematical Programming 94 (2003), 343–359 (Working paper version: PS PDF).
  • T.K.R., SYMPHONY Version 4.0 User’s Manual, Lehigh University Industrial and Systems Engineering Technical Report 03T-006 (2003) (PS PDF).

2002

2001

  • L. Ladányi, T.K.R., and L.E. Trotter Jr., Branch, Cut, and Price: Sequential and Parallel, in Computational Combinatorial Optimization, D. Naddef and M. Juenger, eds., Springer, Berlin (2001), 223-260. (PS PDF).
  • L. Ladányi, T.K.R., and M.J. Saltzman, A Library Hierarchy for Implementing Scalable Parallel Search Algorithms, Lehigh University Industrial and Systems Engineering Technical Report 01T-010 (2001) (PS PDF).
  • T.K.R. and J.C. Hartman, Capacitated Network Routing (A Preliminary Progress Report), Lehigh University Industrial and Systems Engineering Working Paper 01W-009 (2001) (PS PDF).
  • R. Lougee-Heimer, et al., The COIN-OR Initiative: Open-source software accelerates operations research progress, OR/MS Today, October 2001.
  • T.K.R. and L. Ladányi, COIN/BCP User’s Manual (2001) (PS PDF).

Pre-2001

  • T.K.R. and L. Ladányi, SYMPHONY: A Framework for Parallel Branch, Cut, and Price, White paper, Rice University (1999) (PS PDF).
  • T.K.R., W.R. Pulleyblank, and L.E. Trotter Jr., On Capacitated Vehicle Routing, CCOP Technical Report 98-7, Cornell University, School of ORIE, Ithaca, NY (1998).
  • M. Esö, L. Ladányi, T.K.R., and L.E. Trotter Jr., Fully Parallel Generic Branch-and-Cut Framework, Proceedings of the 8th SIAM Conference on Parallel Processing for Scientific Computing (1997).
  • T.K.R., Parallel Branch and Cut for Vehicle Routing, PhD. Thesis, May 1995.
  • T.K.R., On the Mixed Chinese Postman Problem, Operations Research Letters 14 (1993), 123-127 (Working paper version: PS PDF).

If you find something here useful, buy me a beer!

Trackback