## Presentations

### Most current talks by topic

- Big Data and Analytics
- Parallel Computation
- Parallel Tree Search and the CHiPPS Framework
- Parallel Integer Programming with CHiPPS and SYMPHONY
- Parallel Integer Programming with CHiPPS
- What Could a Million Cores do to Solve Integer Programs?
- Multilevel Integer Programming, The Polynomial Time Hierarchy, and Parallel Computing
- Decomposition Methods
- Decomposition in Integer Linear Programming (Tutorial)
- Overview of Decomposition and the DIP Software Framework
- Dip and DipPy: A Decomposition-based Modeling System and Solver
- Generic Decomposition-based Solution Methods
- Automatic Methods for Finding Decompositions
- Disjunctive Methods
- Branching and Cutting with General Disjunctions
- To Branch or To Cut
- Interdiction Branching
- Some Experiments with Branching on General Disjunctions
- Multilevel and Multistage Optimization
- Multistage Discrete Optimization
- Duality, Multilevel Optimization, and Game Theory
- Stochastic MILP
- Generation and Representation of Piecewise Polyhedral Value Functions
- Multistage and Multilevel Integer Programming: Algorithms and Complexity
- The MibS Solver and Heuristics for Bilevel Integer Programming
- Multilevel Integer Programming, The Polynomial Time Hierarchy, and Parallel Computing
- Bilevel Programming and Branching
- Bilevel Programming and MIP
- Duality, Warm Starting, and Sensitivity Analysis
- Duality, Warm Starting, and Sensitivity Analysis in Integer Programming
- Duality in Integer Linear Programming
- Structure of the Value Function of a Mixed Integer Linear Program
- Warm Starting in Integer Linear Programming
- Inverse Optimization
- Computational Complexity
- Multilevel Programming and Complexity of Optimization Problems
- Optimization, Separation, and the Complexity of Inverse Optimization
- Multilevel Integer Programming, The Polynomial Time Hierarchy, and Parallel Computing
- Visualization
- COIN-OR Tutorials
- Introduction to COIN-OR
- The SYMPHONY Framework for Mixed-Integer Linear Programming: Basic Features
- The SYMPHONY Framework for Mixed-Integer Linear Programming: Advanced Features
- Developing Applications with CHiPPS
- Open Source Tools for Optimization in Python
- Estimating Solution Time of Branch-and-bound Algorithms
- Mixed Integer Second Order Cone Optimization
- Overview of Discrete Optimization

### All talks by year

#### 2017

- T.K.R., S. DeNegre, M. Guzelsoy, and A. Hassanzadeh, and S. Tahernajad
*Duality, Multilevel Optimization, and Game Theory: Algorithms and Applications*, Virginia Tech, Blacksburg, VA, September 2017 (PDF)

#### 2016

- T.K.R.
*Duality and Warm-starting in MILP*, Zuse Institute Berlin, Berlin, Germany, September 2016 (PDF) - T.K.R., S. DeNegre, M. Guzelsoy, and A. Hassanzadeh, and S. Tahernajad
*Duality, Multilevel Optimization, and Game Theory: Algorithms and Applications*, Norwegian School of Economics, Bergen, Norway, September 2016 (PDF) - T.K.R.,
*The COIN-OR Optimization Suite: Open Source Tools for Optimization*, International Congress on Mathematical Software, Berlin, Germany, July 2016 - T.K.R.
*Separation, Inverse Optimization, and Decomposition: Some Observations*, International Workshop on Modern Optimization and Applications, Beijing, China, June 2016 (PDF) - T.K.R.
*Separation, Inverse Optimization, and Decomposition: Some Observations*, International Workshop on Column Generation 2016, Buzios, Brazil, May 2016 (PDF) - T.K.R., S. DeNegre, M. Guzelsoy, and A. Hassanzadeh, and S. Tahernajad
*Multistage Discrete Optimization (Tutorial, Part I)*, INFORMS Optimization Society Conference, Princeton, NJ, March 2016 - S. Bolusani, T.K.R., M. Guzelsoy, and A. Mahajan
*Bilevel Optimization and the SYMPHONY MILP Solver (Tutorial, Part II)*, INFORMS Optimization Society Conference, Princeton, NJ, March 2016 - S. Tahernajad, T.K.R., and S. DeNegre
*The MibS Solver for Bilevel Integer Optimization Problems (Tutorial, Part III)*, INFORMS Optimization Society Conference, Princeton, NJ, March 2016 - T.K.R., S. DeNegre, M. Guzelsoy, and A. Hassanzadeh, and S. Tahernajad
*Multistage Discrete Optimization (Plenary)*, First International Workshop on Bilevel Programming, Monterrey, Mexico, March 2016 (PDF) - T.K.R., S. DeNegre, M. Guzelsoy, and A. Hassanzadeh, and S. Tahernajad
*Computational Experience with Algorithms for Solving Multistage Integer Programs*, Aussois Workshop on Combinatorial Optimization, Aussois, France, January 2016 (PDF)

#### 2015

- T.K.R.,
*Open Source Tools for Optimization in Python*, SciPy India, IIT Bombay, Mumbai, India, December 2015 (PDF) - S. Tahernejad and T.K.R.,
*Branch-and-cut Algorithm for Integer Bilevel Linear Optimization Problems*, INFORMS Annual Meeting, Philadelphia, November, 2015. - A. Bulut and T.K.R.,
*Computational Approaches to Mixed Integer Second Order Cone Optimization*, INFORMS Annual Meeting, Philadelphia, November, 2015. - S. Bolusani and T.K.R.,
*Solving Bilevel Linear Optimization Problems in Parallel*, INFORMS Annual Meeting, Philadelphia, November, 2015. - T.K.R., M. Guzelsoy, and A. Hassanzadeh,
*Computational Experience with a Benders Algorithm for Two-stage Stochastic Integer Programming*, INFORMS Annual Meeting, Philadelphia, November, 2015 (PDF). - T.K.R.,
*Big Data Analytics: The Hype and the Hope*, Mountain Talk Webinar given to Lehigh Alumni Association, October, 2015 (PDF) - T.K.R., S. Tahernajad, S. DeNegre, M. Guzelsoy, and A. Hassanzadeh,
*Bilevel Integer Optimization: Theory and Algorithms*, International Symposium on Mathematical Programming 2015, Pittsburgh, PA, July 2015 - A. Bulut and T.K. Ralphs,
*Computational Approaches to Mixed Integer Second Order Cone Optimization*, International Symposium on Mathematical Programming 2015, Pittsburgh, PA, July 2015 - M.J. Saltzman and T.K. Ralphs,
*COIN-OR at 15: Open Source Tools for Operations Research*, International Symposium on Mathematical Programming 2015, Pittsburgh, PA, July 2015 - A. Hassanzadeh, T.K.R., and M. Guzelsoy,
*A Benders’ Algorithm for Two-stage Stochastic Optimization Problems with Mixed Integer Programs*, INFORMS Computing Society Biennial Meeting, Richmond, VA, January 2015 (PDF) - J. Wang and T.K.R.,
*Recent Progress on the DIP Decomposition-based MILP Solver*, INFORMS Computing Society Biennial Meeting, Richmond, VA, January 2015 (PDF)

#### 2014

- T.K.R. and A. Bulut,
*Optimization, Separation, and the Complexity of Inverse Optimization*, INFORMS Annual Meeting, San Francisco, CA, November 2014 (PDF) - A. Bulut and T.K.R.,
*Valid Inequalities for Mixed Integer Second Order Cone Optimization*, INFORMS Annual Meeting, San Francisco, CA, November 2014 - T.K.R.,
*Accessible Analytics: Openness and Operations Research*(Keynote Address), South African Operational Research Society Conference 2014, Parys, South Africa, September 2014 (PDF) - T.K.R., M. Galati, M. O’Sullivan, and J. Wang,
*DIP and DipPy: A Decomposition-based Modeling System and Solver*, International Federation of Operations Research Societies Triennial Conference, Barcelona, Spain, July 2014 (PDF) - T.K.R., M. Guzelsoy, and A. Hassanzadeh,
*Generation and Representation of Piecewise Polyhedral Value Functions*, MINLP 2014, Carnegie Mellon University, Pittsburgh, PA, June 2014 (PDF) - T. Terlaky, J. Goez, S. Cay, T.K.R., P. Belotti, and I. Polik,
*Mixed-integer second-order conic optimization: Disjunctive conic cuts and portfolio models*, MINLP 2014, Carnegie Mellon University, Pittsburgh, PA, June 2014. - T.K.R., A. Bulut, S. DeNegre, M. Guzelsoy, A. Hassanzadeh,
*Multistage Integer Programming: Algorithms and Complexity*, University of Houston, March 2014 (PDF)

#### 2013

- T.K.R., A. Bulut, S. DeNegre, M. Guzelsoy, A. Hassanzadeh,
*Multilevel and Multistage Integer Programming: Algorithms and Complexity*, Oakland University, November 2013 (PDF) - T.K.R., A. Bulut, S. DeNegre, M. Guzelsoy, A. Hassanzadeh,
*Multilevel and Multistage Integer Programming: Algorithms and Complexity*, University of Florida, October 2013. - A. Bulut and T.K.R.,
*On the Complexity and Solution of Inverse Mixed Integer Linear Programs*, INFORMS Annual Meeting, Minneapolis, MN, October 2013 (PDF) - A. Hassanzadeh, T.K.R., and M. Guzelsoy,
*A Generalized Benders’ Algorithm for Two-stage Stochastic Mixed Integer Linear Programs*, INFORMS Annual Meeting, Minneapolis, MN, October 2013 (PDF) - T.K.R., J. Wang, M. Galati, and M. O’Sullivan,
*DIP and DipPy: A Decomposition-based Modeling System and Solver*, INFORMS Annual Meeting, Minneapolis, MN, October 2013 (PDF) - T.K.R., A. Bulut, A. Lodi, and G. Woeginger,
*Multilevel and Multistage Integer Programming: Complexity and Algorithms*, INFORMS Annual Meeting, Minneapolis, MN, October 2013 (PDF) - A. Hassanzadeh, T.K. Ralphs, and M. Guzelsoy,
*An Algorithm for Solving Two-stage Stochastic Programs with Mixed Integer Recourse*, International Conference on Stochastic Programming, Bergamo, IT, July 2013. - T.K.R., A. Bulut, S. DeNegre, M. Guzelsoy, and A. Hassanzadeh
*The Complexity of Search: What We Can Learn from Games*, CPAIOR 2013, IBM T.J. Watson Research Center, May 2013 (PDF) - T.K.R. and J. Wang
*Computational Experience with Hypergraph-based Methods for Automatic Decomposition in Integer Programming*, CPAIOR 2013, IBM T.J. Watson Research Center, May 2013 (PDF) - T.K.R.
*An Introduction to the COIN-OR Optimization Suite: Open Source Tools for Building and Solving Optimization Models*, Optimization Days, Montreal, May 2013 (PDF) - T.K.R., A. Bulut, S. DeNegre, M. Guzelsoy, A. Hassanzadeh,
*Multilevel Integer Programming, The Polynomial Time Hierarchy, and Parallel Computing*, Penn State University, March 2013 (PDF) - J.C. Góez, P. Belotti, I. Polik, T.K.R., and T. Terlaky,
*Disjunctive Conic Cuts*, INFORMS Computing Society Biannual Meeting, Santa Fe, NM, January 2013 (PDF). - T.K.R., et. al.,
*Decomposition Methods for Discrete Optimization (Invited Tutorial)*, INFORMS Computing Society Biannual Meeting, Santa Fe, NM, January 2013 (PDF). - A. Bulut and T.K.R.,
*Inverse Integer Programming: Complexity and Algorithms*, INFORMS Computing Society Biannual Meeting, Santa Fe, NM, January 2013 (PDF). - A. Hassanzadeh, T.K.R., and M. Guzelsoy,
*A Value Function Approach for Solving Two-stage Stochastic Programs with Mixed Integer Recourse*, INFORMS Computing Society Biannual Meeting, Santa Fe, NM, January 2013 (PDF). - T.K.R., A. Bulut, M. O’Sullivan, O. Ozaltin, and B. Hunsaker,
*GiMPy and GrUMPy: Visualization for Optimization in Python*, INFORMS Computing Society Biannual Meeting, Santa Fe, NM, January 2013 (PDF).

#### 2012

- J.C. Góez, P. Belotti, I. Polik, T.K.R., and T. Terlaky,
*Branch and Bound for Mixed Integer Second Order Cone Optimization: Impact of Disjunctive Conic Cuts*, INFORMS Annual Conference, Phoenix, AZ, November 2012. - T.K.R., M.V. Galati, and J. Wang,
*DIP and DIPPy: Towards a Generic, Decomposition-based MIP Solver*, INFORMS Annual Conference, Phoenix, AZ, October 2012 (PDF). - T.K.R. and S. Yildiz,
*Some Experiments on Branching with General Disjunctions*, INFORMS Annual Conference, Phoenix, AZ, October 2012 (PDF). - A. Bulut and T.K.R.,
*An Algorithm for Solving Inverse Integer Programs*, INFORMS Annual Conference, Phoenix, AZ, October 2012 (PDF). - A. Hassanzadeh, T.K.R., and M. Guzelsoy,
*An Algorithm for Solving Two-stage Stochastic Programs with Mixed Integer Recourse*, INFORMS Annual Conference, Phoenix, AZ, October 2012 (PDF). - T.K.R., T. Koch, and Y. Shinano,
*Could we Use a Million Cores to Solve a Single Integer Program?*, INFORMS Annual Conference, Phoenix, AZ, October 2012 (PDF). - T.K.R., A. Bulut, M. O’Sullivan, O. Ozaltin, and B. Hunsaker,
*GiMPy and GrUMPy: Visualization for Optimization in Python*, INFORMS Annual Conference, Phoenix, AZ, October 2012. - T.K.R., A. Bulut, A. Lodi, F. Rossi, S. Smriglio, and G. Woeginger,
*Complexity and Multilevel Optimization*, University of Kyoto, Kyoto, Japan, September 2012. - T.K.R., A. Bulut, A. Lodi, F. Rossi, S. Smriglio, and G. Woeginger,
*Complexity and Multilevel Optimization*, Chuo University, Tokyo, Japan, September 2012. - T.K.R., M.V. Galati, and J. Wang,
*Computational Experience with Generic Decomposition using the DIP framework*, RAMP Symposium, Tokyo, Japan, September 2012. - T.K.R., M.V. Galati, and J. Wang,
*Generic Decomposition-based Solution Methods*, International Symposium on Mathematical Programming, Berlin, Germany, August 2012 (PDF). - T.K.R., A. Bulut, A. Lodi, F. Rossi, S. Smriglio, and G. Woeginger,
*Complexity and Multilevel Optimization*, Mixed Integer Programming Workshop, UC Davis, July 2012 (PDF).

#### 2011

- T.K.R., M. Galati, and J. Wang,
*DIP with CHiPPS: Decomposition in Integer Linear Programming*, CSIRO, Melbourne, Australia, December 2011 (PDF). - T.K.R.
*Making Molehills out of Mountains: A Guided Tour of Discrete Optimization*, CSIRO, Melbourne, Australia, December 2011 (PDF). - T.K.R. and Y. Xu,
*Computational Approaches to Solving Integer Programs in Parallel*, INFORMS Annual Conference, Charlotte, NC, November 2011 (PDF). - T.K.R., S. DeNegre, and M. Guzelsoy,
*Computational Experience Solving Bilevel Programs*, INFORMS Annual Conference, Charlotte, NC, November 2011 (PDF). - J.C. Góez, P. Belotti, I. Polik, T.K.R., and T. Terlaky,
*Generating the Convex Hull of Disjunctions in Mixed Integer Second Order Cone Optimization*, INFORMS Annual Conference, Charlotte, NC, November 2011. - G. Gamrath et al.,
*MIPLIB 2010*, INFORMS Annual Conference, Charlotte, NC, November 2011. - T.K.R., M. Galati, and J. Wang,
*DIP with CHiPPS: Decomposition in Integer Linear Programming*, University of Michigan, Ann Arbor, MI, November 2011 (PDF). - T.K.R. and M. Galati,
*DIP with CHiPPS: Decomposition in Integer Linear Programming*, ExxonMobil Research, Annandale, NJ, October 2011 (PDF). - J.C. Góez, P. Belotti, I. Polik, T.K.R., and T. Terlaky,
*Generating the Convex Hull of a Disjunction for Mixed Integer Second Order Cone Optimization*, MOPTA, Bethlehem, PA, August 2011. - T.K.R. and Y. Xu,
*Computational Approaches to Solving Integer Programs in Parallel*, SIAM Conference on Optimization, Darmstadt, Germany, May 2011 (PDF). - T.K.R., S. DeNegre, and M. Guzelsoy,
*Bilevel Integer Linear Programming*, University of Edinburgh, Edinburgh, UK, May 2011 (PDF). - T.K.R., M. Galati, and Y. Xu,
*DIP with CHiPPS: Decomposition in Integer Linear Programming*, Cornell University, Ithaca, NY, March 2011 (PDF). - T.K.R., S. DeNegre, and M. Guzelsoy,
*Bilevel Integer Linear Programming*, Northwestern University, Chicago, IL, January 2011 (PDF).

#### 2010

- T.K.R.,
*COIN-OR: Revving Up the Engine*, INFORMS Annual Conference, Austin, TX, November 2010 (PDF). - T.K.R., A. Lodi, F. Rossi, and S. Smriglio,
*Interdiction Branching*, INFORMS Annual Conference, Austin, TX, November 2010 (PDF). - M. Galati and T.K.R.,
*Progress Update on COIN/DIP – Decomposition for Integer Programming*, INFORMS Annual Conference, Austin, TX, November 2010. - A. Mahajan and T.K.R.,
*Selecting Disjunctions for Solving MILPs*, INFORMS Annual Conference, Austin, TX, November 2010. - S. DeNegre and T.K.R.,
*Sensor Placement in Water Networks: An Interdiction Model*, INFORMS Annual Conference, Austin, TX, November 2010. - J.C. Góez, P. Belotti, I. Polik, T.K.R., and T. Terlaky,
*Disjunctive Conic Cuts for Mixed Integer Second Order Cone Optimization*, INFORMS Annual Conference, Austin, TX, November 2010. - T.K.R., S. DeNegre, M. Guzelsoy, A. Lodi, F. Rossi, and S. Smriglio,
*Bilevel Integer Programming*, University of Pittsburgh, Pittsburgh, PA, October 2010 (PDF). - J.C. Góez, P. Belotti, I. Polik, T.K.R., and T. Terlaky,
*Disjunctive Conic Cuts for Second Order Cone Optimization*, MOPTA, Bethlehem, PA, August 2010. - T.K.R.,
*Benchmarking and Performance Analysis of Optimization Software*, CPAIOR 2010, Bologna, Italy, June 2010 (PDF). - T.K.R. and Y. Xu,
*The COIN-OR High-Performance Parallel Search Framework*, CPAIOR 2010, Bologna, Italy, June 2010 (PDF). - T.K.R. and M. Galati,
*DIP with ChiPPS: Decomposition Methods for Integer Linear Programming*, University of Bordeaux, Bordeaux, France, June 2010 (PDF). - T.K.R. and M. Galati,
*DIP with ChiPPS: Decomposition Methods for Integer Linear Programming*, University of Edinburgh, Edinburgh, Scotland, June 2010. - T.K.R.,
*Introduction to COIN-OR Tools for Optimization*, COR@L Seminar, Lehigh University, January 2010 (PDF). - T.K.R., S. DeNegre, M. Guzelsoy, A. Lodi, F. Rossi, and S. Smriglio,
*Bilevel Integer Linear Programming*, Workshop on Combinatorial Optimization, Aussois, France, January 2010 (PDF). - A. Lodi, T.K.R., F. Rossi, and S. Smriglio,
*Interdiction Branching*, Workshop on Combinatorial Optimization, Aussois, France, January 2010.

#### 2009

- T.K.R., Y. Xu, L. Ladanyi, and M.Saltzman,
*Implementing Custom Applications with CHiPPS*, INFORMS Annual Conference, San Diego, October 2009 (PDF). - T.K.R., Y. Xu, L. Ladanyi, and M.Saltzman,
*Computational Experience with Parallel Integer Programming using the CHiPPS Framework*, INFORMS Annual Conference, San Diego, October 2009 (PDF). - M. Guzelsoy, T.K.R.
*On the Value Function of a Mixed Integer Linear Program*, INFORMS Annual Conference, San Diego, October 2009 (PDF). - S. DeNegre, T.K.R.
*Branch and Cut for Mixed Integer Bilevel Linear Programs*, INFORMS Annual Conference, San Diego, October 2009 (PDF). - M. Galati and T.K.R.,
*A Framework for Decomposition in Integer Programming*, INFORMS Annual Conference, San Diego, October 2009 (PDF). - T.K.R.,
*Introduction to COIN-OR Tools for Optimization*, Combinatorial Optimization at Work, ZIB, Berlin, September 2009 (PDF). - A. Mahajan and T.K.R.,
*To Branch or To Cut*, International Symposium on Mathematical Programming, Chicago, August 2009 (PDF). - T.K.R., A. Lodi, F. Rossi, and S. Smriglio,
*Bilevel Branching*, International Symposium on Mathematical Programming, Chicago, August 2009 (PDF). - T.K.R., S. DeNegre, and E. Suet Tse,
*A Bilevel Integer Nonlinear Programming Model for Cross-layer Network Design Optimization*, International Symposium on Mathematical Programming, Chicago, August 2009 (PDF). - M. Galati and T.K.R.,
*A Framework for Decomposition in Integer Programming*, International Symposium on Mathematical Programming, Chicago, August 2009 (PDF). - T.K.R. and S. Denegre,
*Bilevel Integer Linear Programming*, MOPTA 2009, Bethlehem, PA, August 2009 (PDF). - T.K.R. and M. Galati,
*A Framework for Decomposition in Integer Programming*, University of Newcastle, Newcastle, NSW, Australia, June 2009 (PDF). - T.K.R., Y. Xu, L. Ladanyi, and M.Saltzman,
*Doing it in Parallel (DIP) with the COIN-OR High Performance Parallel Search Framework (CHiPPS)*, University of Newcastle, Newcastle, NSW, Australia, May 2009 (PDF). - A. Mahajan and T.K.R.,
*In Search of Optimal Disjunctions in Mixed Integer Programming*, University of Newcastle, Newcastle, NSW, Australia, May 2009 (PDF). - T.K.R. and S. Denegre,
*Bilevel Integer Linear Programming*, University of Newcastle, Newcastle, NSW, Australia, May 2009 (PDF). - T.K.R. and M. Guzelsoy,
*Duality in Mixed Integer Linear Programming*, University of Newcastle, Newcastle, NSW, Australia, May 2009 (PDF). - T.K.R. and M. Guzelsoy,
*Duality in Mixed Integer Linear Programming*, Monash University, Melbourne, VIC, Australia, April 2009. - T.K.R. and S. Denegre,
*Bilevel Integer Linear Programming*, University of Melbourne, VIC, Australia, April 2009. - A. Mahajan and T.K.R.,
*In Search of Optimal Disjunctions in Mixed Integer Programming*, Monash University, Melbourne, VIC, Australia, April 2009. - T.K.R. and M. Galati,
*A Framework for Decomposition in Integer Programming*, Monash University, Melbourne, VIC, Australia, March 2009. - T.K.R., Y. Xu, L. Ladanyi, and M. Saltzman,
*Doing it in Parallel (DIP) with the COIN-OR High Performance Parallel Search Framework (CHiPPS)*, Monash University, Melbourne, VIC, Australia, March 2009. - T.K.R. and M. Guzelsoy,
*Duality in Mixed Integer Linear Programming*, University of Canterbury, Christchurch, New Zealand, February 2009. - T.K.R.,
*Introduction to COIN-OR: Open Source Software for Optimization*, University of Canterbury, Christchurch, New Zealand, February 2009 (PDF). - T.K.R. and M. Guzelsoy,
*On the Value Function of a General Mixed Integer Linear Program*, Victoria University of Wellington, New Zealand, January 2009. - T.K.R. and S. Denegre,
*Bilevel Integer Linear Programming*, Victoria University of Wellington, New Zealand, January 2009. - T.K.R. and S. Denegre,
*Bilevel Integer Linear Programming*, University of Auckland, New Zealand, January 2009.

#### 2008

- A. Mahajan and T.K.R.,
*In Search of Optimal Disjunctions in Mixed Integer Programming*, Argonne National Labs, Chicago, IL, December 2008 (PDF). - T.K.R. and S. Denegre,
*Bilevel Integer Linear Programming*, Université Bordeaux, France, December 2008 (PDF). - T.K.R.,
*Short Course in Bilevel Programming*, Università di Bologna, Italy, December 2008. - T.K.R. and S. Denegre,
*Bilevel Integer Linear Programming*, Politecnico di Milano, November 2008. - T.K.R.,
*Optimization and Combinatorial Auctions*, Institute for Advanced Studies, Università di Bologna, Italy, November 2008. - S. Denegre and T.K.R.,
*A Mixed Integer Bilevel Programming Solver*, INFORMS Annual Meeting, Washington, D.C., October, 2008. - Y. Xu, T.K.R., L. Ladanyi, and M.J. Saltzman,
*Developing Applications Based on CHiPPS*, INFORMS Annual Meeting, Washington, D.C., October, 2008. - S. Denegre and T.K.R.,
*Mixed Integer Interdiction*, INFORMS Annual Meeting, Washington, D.C., October, 2008. - A. Mahajan and T.K.R.,
*On Branching on General Hyperplanes for Mixed Integer Programming*, INFORMS Annual Meeting, Washington, D.C., October, 2008. - M. Guzelsoy, A. Mahajan, and T.K.R.,
*The SYMPHONY MIP Solver*, INFORMS Annual Meeting, Washington, D.C., October, 2008. - M. Guzelsoy and T.K.R.,
*Warm Starting for Mixed Integer Linear Programming*, INFORMS Annual Meeting, Washington, D.C., October, 2008. - T.K.R. and S. Denegre,
*Bilevel Integer Linear Programming*, Università degli Studi dell’Aquila, Italy, September 2008. - T.K.R. and M. Guzelsoy,
*On the Value Function of a General Mixed Integer Linear Program*, XXXIX Annual Conference of Italian Operational Research Society, Ischia, Italy, September, 2008 (PDF). - Z. Akca, R. Berger, T.K.R.,
*Optimizing Location, Routing, and Scheduling Decisions Under Capacity Restrictions*, Column Generation 2008, Aussois, France, June 2008. - M. Galati, T.K.R.,
*A Framework for Decomposition in Integer Programming*, Column Generation 2008, Aussois, France, June 2008 (PDF). - T.K.R., Y. Xu, L. Ladanyi, and M.Saltzman,
*Doing it in Parallel (DIP) with the COIN-OR High Performance Parallel Search Framework (CHiPPS)*, Graduate Research Seminar, Pennsylvania State University, April, 2008 (PDF). - Y. Xu, T.K.R., M.J. Saltzman, and L. Ladányi,
*The CHiPPS Framework for Parallel Tree Search and Integer Programming*, INFORMS Optimization Society Conference, Atlanta, GA, March, 2008. - M. Galati, T.K.R.,
*DECOMP: A Framework for Decomposition in Integer Programming*, INFORMS Optimization Society Conference, Atlanta, GA, March, 2008. - T.K.R. and M. Guzelsoy,
*The Value Function of a Mixed Integer Program with a Single Constraint*, INFORMS Optimization Society Conference, Atlanta, GA, March, 2008 (PDF). - T.K.R. and M. Guzelsoy,
*The Value Function of a Mixed Integer Program with a Single Constraint*, COPTA Seminar, University of Wisconsin-Madison, February, 2008 (PDF).

#### 2007

- Y. Xu, T.K.R., M.J. Saltzman, and L. Ladányi,
*A Framework for Implementing Parallel Tree Search Algorithms*, INFORMS Annual Conference, Seattle, WA, November, 2007. - M. Galati and T.K.R.,
*DECOMP: A Framework for Decomposition in Integer Programming*, INFORMS Annual Conference, Seattle, WA, November, 2007. - O. Osaltyn, B. Hunsaker, and T.K.R.,
*Estimating Solution Time of Branch-and-bound Algorithm*, INFORMS Annual Conference, Seattle, WA, November, 2007. - B. Hunsaker, O. Osaltyn, and T.K.R.,
*Visualization Tools for Branch-and-bound Algorithms*, INFORMS Annual Conference, Seattle, WA, November, 2007 (a href=”/~ted/files/talks/visualization.pdf”>PDF) - Z. Akca, R. Berger, and T.K.R.,
*Solving Integrated Location, Routing and Scheduling Problems*, INFORMS Annual Conference, Seattle, WA, November, 2007. - S. DeNegre and T.K.R.,
*Solution Approaches for Integer Bilevel Programs*, INFORMS Annual Conference, Seattle, WA, November, 2007. - Y. Xu, T.K.R., M.J. Saltzman, and L. Ladányi,
*The Design and Implementation of BLIS*, INFORMS Annual Conference, Seattle, WA, November, 2007. - M. Guzelsoy and T.K.R.,
*The SYMPHONY Callable Library*, INFORMS Annual Conference, Seattle, WA, November, 2007. - M. Guzelsoy and T.K.R.,
*The Value Function of a Mixed-integer Linear Program with a Single Constraint*, INFORMS Annual Conference, Seattle, WA, November, 2007. - T.K.R. and M. Guzelsoy,
*Warm Starting for Mixed Integer Linear Programs*, INFORMS Annual Conference, Seattle, WA, November, 2007 (PDF). - S. DeNegre and T.K.R.,
*Integer Bilevel Linear Programming: A Novel Branch-and-Cut Algorithm*, INFORMS International Conference, Puerto Rico, July, 2007. - B. Hunsaker, O. Osaltyn, and T.K.R.,
*Visualization Tools for Branch-and-Bound*, The Tenth INFORMS Computing Society Conference, Miami, FL, January, 2007.

#### 2006

- T.K.R., M. Guzelsoy, J.T. Linderoth, M.J. Saltzman, and M. Wiecek,
*Using Cyberinfrastructure Tools to Solve Biobjective Integer Programs*, INFORMS Annual Conference, Pittsburgh, PA, November 2006 (PDF). - M.J. Saltzman, L. Ladányi, and T.K.R.,
*The COIN-OR Open Solver Interface: Inside a Portable Solver API*, INFORMS Annual Conference, Pittsburgh, PA, November 2006. - K. Martin, JP Fasano, and T.K.R.,
*Source Code Not Required: Using the COIN-OR Binaries*, INFORMS Annual Conference, Pittsburgh, PA, November 2006. - M.V. Galati and T.K.R.,
*DECOMP: A Framework for Decomposition in Integer Programming*, INFORMS Annual Conference, Pittsburgh, PA, November 2006. - Y. Xu, T.K.R., L. Ladányi, and M.J. Saltzman,
*A Library Hierarchy for Implementing Scalable Parallel Search Algorithms*, INFORMS Annual Conference, Pittsburgh, PA, November 2006. - S. DeNegre and T.K.R.,
*Multiobjective Mixed-Integer Stackelberg Games*, The International Symposium on Mathematical Programming, Rio de Janeiro, Brazil, August 2006. - T.K.R., Y. Xu, M.J. Saltzman, and L. Ladányi,
*Parallel Integer Programming with ALPS*, The International Symposium on Mathematical Programming, Rio de Janeiro, Brazil, August 2006 (PDF). - T.K.R.,
*The SYMPHONY Framework for Mixed-Integer Linear Programming: Basic Features*, DIMACS Workshop on COIN-OR, Rutgers University, July 2006 (PDF). - T.K.R.,
*The SYMPHONY Framework for Mixed-Integer Linear Programming: Advanced Features*, DIMACS Workshop on COIN-OR, Rutgers University, July 2006 (PDF). - T.K.R. and S. DeNegre,
*Multiobjective Mixed-Integer Stackelberg Games*, EURO XXI, Reykjavic, Iceland, June 2006 (PDF). - M.J. Saltzman, Y. Xu, T.K.R., and L. Ladányi,
*A Library Hierarchy for Implementing Scalable Parallel Search Algorithms*, EURO XXI, Reykjavic, Iceland, June 2006. - T.K.R., M. Saltzman, and M. Galati,
*Using COIN-OR to Solve the Uncapacitated Facility Location Problem*, EURO XXI, Reykjavic, Iceland, June 2006 (PDF). - T.K.R., M. Guzelsoy, J.T. Linderoth, M.J. Saltzman, and M. Wiecek,
*Biobjective Integer Programming*, MIP 2006: Workshop on Mixed-Integer Programming, University of Miami, June 2006 (PS PDF). - T.K.R., M. Guzelsoy, J.T. Linderoth, M.J. Saltzman, and M. Wiecek,
*Biobjective Integer Programming*, SAS Institute , June 2006. (PS PDF).

#### 2005

- T.K.R. and M. Guzelsoy,
*The SYMPHONY Callable Library*, INFORMS Annual Conference, San Francisco, CA, November 2005 (PS PDF). - Y. Xu, T.K.R., L. Ladányi, and M.J. Saltzman,
*A Library Hierarchy for Implementing Scalable Parallel Search Algorithms*, INFORMS Annual Conference, San Francisco, CA, November 2005 (PS PDF). - M.V. Galati and T.K.R.,
*DECOMP: A Framework for Decomposition and Dynamic Cut Generation in Integer Programming*, INFORMS Annual Conference, San Francisco, CA, November 2005. - T.K.R. and A. Pilatin,
*Parallel Solution of Vehicle Routing Problems*, INFORMS Annual Conference, San Francisco, CA, November 2005 (PS PDF). - T.K.R., M. Guzelsoy, M. Saltzman, and M. Wiecek,
*Bioobjective Integer Programming*, Rutgers University, Department of Industrial and Systems Engineering, Piscataway, NJ, October 2005 (PS PDF). - T.K.R. and M. Guzelsoy,
*Duality, Sensitivity Analysis, and Warm Starting*, SAS Institute , August 2005. (PS PDF). - T.K.R.,
*Making Molehills out of Mountains: A Guided Tour of Large-scale Discrete Optimization*, Mathematics Department Colloquium, April 2005. (PS PDF). - T.K.R.,
*Capacitated Vehicle Routing and Some Related Problems*, Computer Science and Engineering Seminar Series, March 2005. (PS PDF). - Y. Xu, T.K.R., L. Ladányi, and M.J. Saltzman,
*ALPS: A Framework for Implementing Parallel Tree Search Algorithms*, Fourth International Workshop of the EURO Working Group on Parallel Processing in Operations Research, Mont Tremblant, Canada, January 2005. - T.K.R. and M. Guzelsoy,
*A Mini-Tutorial on the SYMPHONY Callable Library for Mixed-Integer Linear Programming*, The Ninth INFORMS Computing Society Conference, Annapolis, MD, January 2005 (PS PDF). - T.K.R. and M. Guzelsoy,
*The SYMPHONY Callable Library for Mixed-Integer Linear Programming*, The Ninth INFORMS Computing Society Conference, Annapolis, MD, January 2005 (PS PDF). - M.V. Galati and T.K.R.,
*DECOMP: A Framework for Decomposition and Dynamic Cut Generation in Integer Programming*, The Ninth INFORMS Computing Society Conference, Annapolis, MD, January 2005. - Y. Xu, T.K.R., L. Ladányi, and M.J. Saltzman,
*ALPS: A Framework for Implementing Parallel Tree Search Algorithms*, The Ninth INFORMS Computing Society Conference, Annapolis, MD, January 2005.

#### 2004

- T.K.R. and M. Guzelsoy,
*Duality, Warm Starting, and Sensitivity Analysis in Integer Programming*, the Institute for Operations Research and Management Science Annual Conference, Denver, CO, October 2004 (PS PDF). - M.V. Galati and T.K.R.,
*A Framework for Decomposition and Dynamic Cut Generation in Integer Programming*, the Institute for Operations Research and Management Science Annual Conference, Denver, CO, October 2004. - Y. Xu, T.K.R., L. Ladányi, and M.J. Saltzman,
*A Framework for Implementing Parallel Tree Search Algorithms*, the Institute for Operations Research and Management Science Annual Conference, Denver, CO, October 2004. - M.J. Saltzman, L. Ladányi, and T.K.R. ,
*The New COIN-OR Open Solver Interface*, the Institute for Operations Research and Management Science Annual Conference, Denver, CO, October 2004. - T.K.R.,
*Integer Programming: A Research Overview*, Lehigh IGERT Seminar, September 2004. (PS PDF). - T.K.R.,
*Computational Infrastructure for Operations Research: The COIN-OR Project*, International Conference on Continuous Optimization, Rensselaer Polytechnic Institute, August 2004 (PS PDF). - T.K.R. et.al,
*COIN-OR: Software Tools for Optimization*(**Workshop**), CORS/INFORMS Joint International Meeting, Banff, Alberta, Canada, May 2004. - T.K.R., M. Guzelsoy, M.J. Saltzman, and M. Wiecek,
*An Open Source Solver for Bicriteria Mixed Integer Programs*, CORS/INFORMS Joint International Meeting, Banff, Alberta, Canada, May 2004 (PS PDF). - M.V. Galati and T.K.R.,
*DECOMP: A Framework for Decomposition and Dynamic Cut Generation in Integer Programming*, CORS/INFORMS Joint International Meeting, Banff, Alberta, Canada, May 2004. - Y. Xu, T.K.R., L. Ladányi, and M.J. Saltzman,
*A Framework for Scalable Parallel Tree Search*, CORS/INFORMS Joint International Meeting, Banff, Alberta, Canada, May 2004 (PS PDF). - M.J. Saltzman, L. Ladányi, and T.K.R.,
*The COIN-OR Open Solver Interface: Technology Overview*, CORS/INFORMS Joint International Meeting, Banff, Alberta, Canada, May 2004. - T.K.R. and M.V. Galati,
*Decomposition and Dynamic Cut Generation in Integer Programming*, the Eighth Aussois International Workshop on Combinatorial Optimization, Aussois, France, January 2004 (PS PDF).

#### 2003

- Y. Xu, T.K.R., L. Ladányi, and M.J. Saltzman,
*A Framework for Scalable Parallel Tree Search*, the Institute for Operations Research and Management Science Annual Conference, Atlanta, GA, October 2003. - T.K.R. and M.V. Galati,
*Decomposition and Dynamic Cut Generation in Integer Programming*, the Institute for Operations Research and Management Science Annual Conference, Atlanta, GA, October 2003 (PS PDF). - T.K.R., L. Ladányi, and M.J. Saltzman ,
*Tutorial: COIN-OR: Software Tools for Implementing Custom Solvers*, the Institute for Operations Research and Management Science Annual Conference, Atlanta, GA, October 2003 (**Tutorial**). (PS PDF). - M.J. Saltzman, L. Ladányi, and T.K.R. ,
*New Developments in The COIN Open Solver Interface*, the Institute for Operations Research and Management Science Annual Conference, Atlanta, GA, October 2003. - B. Hunsaker, J. Forrest, R. Lougee-Heimer, T.K.R., and M.J. Saltzman,
*A Gentle Introduction to COIN-OR’s Open Solver Interface*, the Institute for Operations Research and Management Science Annual Conference, Atlanta, GA, October 2003. - T.K.R.,
*Integer Programming: A Research Overview*, Lehigh IGERT Seminar, September 2003. (PS PDF). - T.K.R., L. Ladányi, M.J. Saltzman, and Y. Xu,
*A Framework for Scalable Parallel Tree Search*, the International Symposium on Mathematical Programming, Copenhagen, Denmark, August 2003. (PS PDF). - M. Galati and T.K.R.,
*Decomposition and Dynamic Cut Generation in Integer Programming*, the International Symposium on Mathematical Programming, Copenhagen, Denmark, August 2003. (PS PDF). - T.K.R., L. Ladányi, and M.J. Saltzman ,
*COIN-OR: Software Tools for Implementing Custom Solvers*, the International Symposium on Mathematical Programming, Copenhagen, Denmark, August 2003 (**Workshop**). (PS PDF). - M.J. Saltzman, L. Ladányi, and T.K.R. ,
*The COIN Open Solver Interface: A Progress Report*, the International Symposium on Mathematical Programming, Copenhagen, Denmark, August 2003. - T.K.R. and M. Galati,
*Decomposition and Dynamic Cut Generation in Integer Programming*, Discussions on Mixed Integer Programming ’03 , Columbia University, June 2003. (PS PDF).

#### 2002

- T.K.R., L. Ladányi, and M.J. Saltzman,
*Software Tools for Implementing Branch, Cut, and Price Algorithms*, The Institute for Operations Research and Management Science Annual Conference, San Jose, CA, November 2002 (**Workshop**). (PS PDF). - T.K.R., L. Ladányi and M.J. Saltzman,
*A Library Hierarchy for Implementing Scalable Parallel Search Algorithms*, The Institute for Operations Research and Management Science Conference, San Jose, CA, November 2002. (PS PDF). - M. Galati and T.K.R.,
*Decomposition-based Algorithms for Large-scale Discrete Optimization*, The Institute for Operations Research and Management Science Annual Conference, San Jose, CA, November 2002. - T.K.R.,
*Solving Hard Combinatorial Problems: A Research Overview*, Lehigh IGERT Seminar, October 2002. (PS PDF). - T.K.R., L. Ladányi, and M.J. Saltzman,
*A New Framework for Scalable Parallel Tree Search*, Lehigh ISE Optimization Seminar, September 2002. (PS PDF). - M.J. Saltzman, T.K.R., and L. Ladányi,
*A Library Hierarchy for Implementing Scalable Parallel Search Algorithms*, The International Federation of Operations Research Societies Conference, University of Edinburgh, July 2002. - T.K.R.,
*The Common Optimization Interface for Operations Research (COIN-OR) Initiative*, The International Federation of Operations Research Societies Conference, University of Edinburgh, July 2002. (PS PDF). - M.J. Saltzman, T.K.R., and L. Ladányi,
*A Library Hierarchy for Implementing Scalable Parallel Search Algorithms*, The Integer Programming Conference in Honor of Egon Balas’ 80th Birthday, Carnegie-Mellon University, June 2002. - T.K.R., L. Ladányi, and M.J. Saltzman,
*A Library Hierarchy for Scalable Parallel Tree Search*, Parallel Processing in Operations Research , Guadeloupe, France, May 2002 (PS PDF). - T.K.R., L. Ladányi, and M.J. Saltzman,
*Implementing Scalable Parallel Search Algorithms for Data-intensive Applications*, International Conference on Computational Science, University of Amsterdam, April 2002 (PS PDF). - T.K.R.,
*Solving Hard Combinatorial Problems: A Research Overview*, Process Modeling and Control Seminar, Department of Chemical Engineering, Lehigh University, March 2002(PS PDF). - T.K.R.,
*Decomposition-based Algorithms for Large-scale Discrete Optimization*, National University of Singapore, March 2002 (PS PDF).

#### 2001

- L. Ladányi and T.K.R., em>Open-source Tool Kit for Implementing Branch, Cut, and Price Algorithms, The Institute for Operations Research and Management Science Annual Conference, Miami, FL, November 2001 (
**Workshop**). - T.K.R. and J.C. Hartman,
*Branch and Cut for Capacitated Network Routing*, The Institute for Operations Research and Management Science Annual Conference, Miami, FL, November 2001 (PS PDF). - L. Ladányi and T.K.R.,
*Branch, Cut, and Price: The Next Generation*, The Institute for Operations Research and Management Science Conference, Miami, FL, November 2001. - M. Galati and T.K.R.,
*Valid Inequalities for the Cable Trench Problem*, The Institute for Operations Research and Management Science Annual Conference, Miami, FL, November 2001. - T.K.R.,
*Capacitated Vehicle Routing and Some Related Problems*, Rutgers University, Department of Industrial and Systems Engineering, Piscataway, NJ, November 2001 (PS PDF). - T.K.R., L. Ladányi, and M.J. Saltzman,
*A Library Hierarchy for Implementing Scalable Parallel Search Algorithms*, Rutgers Center for Operations Research (RUTCOR), Rutgers University, Piscataway, NJ, September 2001. (PS PDF). - T.K.R.,
*Branch, Cut, and Price Algorithms for Large-scale Discrete Optimization*, National University of Singapore, August 2001 (PS PDF). - T.K.R. and J.C. Hartman,
*Capacitated Network Routing*, National University of Singapore, August 2001 (PS PDF). - T.K.R., L. Ladányi, and M.J. Saltzman,
*A Library Hierarchy for Implementing Scalable Parallel Search Algorithms*, IBM T.J. Watson Research Center, Yorktown Heights, NY, August 2001 (PS PDF). - T.K.R.,
*Decomposition-based Algorithms for Discrete Optimization*, IBM T.J. Watson Research Center, Yorktown Heights, NY, August 2001. (slides available by request).

- T.K.R. and J.C. Hartman,
*Capacitated Network Routing*, IBM T.J. Watson Research Center, Yorktown Heights, NY, July 2001 (PS PDF). - T.K.R.,
*Branch, Cut, and Price for Routing and Packing Problems*, INFORMS International, Maui, HI, June 2001 (PS PDF). - T.K.R.,
*Implementing Branch, Cut, and Price Algorithms*, Workshop on Novel Approaches to Hard Discrete Optimization Problems, University of Waterloo, April 2001 (PS PDF).

#### 2000

- T.K.R.,
*A Branch and Cut Algorithm for the Vehicle Routing Problem*, The Institute for Operations Research and Management Science Conference, San Antonio, TX, November 2000 (PS PDF). - T.K.R.,
*Solving Hard Combinatorial Problems: A Research Overview*, Department of Industrial and Manufacturing Systems Engineering Seminar Series, Lehigh University, Bethlehem, PA, September 2000 (PS PDF). - T.K.R.,
*Parallel Branch and Cut for Dummies*, International Symposium on Mathematical Programming, Atlanta, GA, August 2000 (PS PDF). - T.K.R. and L. Ladányi,
*SYMPHONY: A Framework for Parallel Branch and Cut*, DONET Spring School on Computation Combinatorial Optimization, Saarbrucken, Germany, May 2000 (PS PDF). - T.K.R., L. Kopman, W. Pulleyblank, and L.E. Trotter Jr.,
*A Generic Separation Algorithm for Combinatorial Optimization*, DONET Workshop on Combinatorial Optimization, Aussois, France, March 2000 (**Instructor**) (PS PDF).

#### Pre-2000

- T.K.R., W. Pulleyblank, and L.E. Trotter Jr.,
*A New Generic Separation Algorithm and Its Application to the Vehicle Routing Problem*The Institute for Operations Research and Management Science Annual Conference, Philadelphia, PA, November 1999 (PS PDF). - T.K.R., W. Pulleyblank, and L.E. Trotter Jr.,
*A New Generic Separation Algorithm for Combinatorial Optimization,*IBM T.J. Watson Research Center, Yorktown Heights, NY, November 1999 (PS PDF). - T.K.R. and L. Ladányi,
*Computational Experience with Generic Parallel Branch and Cut*, The Institute for Operations Research and Management Science Annual Conference, Seattle, WA, October 1998 (PS PDF). - T.K.R., W. Pulleyblank, and L. Trotter Jr.,
*Parallel Branch and Cut for Vehicle Routing*, The International Symposium on Mathematical Programming ’97, Lausanne, Switzerland, August 1997. - M. Eso, L. Ladányi, T.K.R., and L.E. Trotter Jr.,
*Fully Parallel Generic Branch-and-Cut Framework*, The 8th SIAM Conference on Parallel Processing for Scientific Computing, Minneapolis, MN, March 1997. - T.K.R.,
*Polyhedral Aspects of the Mixed Postman Problem*, Cornell Computational Optimization Project Colloquium, Ithaca, NY, February 1994. - T.K.R. and L. Ladányi,
*Computational Experience with a New Heuristic for the Crew Scheduling Problem,*Cornell Computational Optimization Project Colloquium, Ithaca, NY, October 1993.

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