Scientific Talks

  1. March 15, 2000, Integral Decomposition of Polyhedra and Test Sets for Mixed-Integer Programs, Fourth Workshop on Combinatorial Optimization, Aussois, France.
  2. May 25, 2000, Integral Decomposition of Polyhedra and Test Sets for Mixed-Integer Programs, 14th Workshop on Discrete Optimization, Holzhau, Germany.
  3. September 10, 2000, Integral Decomposition of Polyhedra and Some Applications in Mixed Integer Programming, Symposium on Operations Research 2000, TU Dresden, Germany.
  4. March 15, 2001, The Integral Basis Method for Integer Programming, DONET Short Course on Primal Integer Programming at Istituto di Analisi dei Sistemi ed Informatica (IASI), Roma, Italy.
  5. May 15, 2002, A Primal All-Integer Integer Programming Algorithm Based on Irreducible Solutions, 15th Workshop on Discrete Optimization, Wittenberg, Germany.
  6. June 17, 2002, Primal (Mixed) Integer Programming, "Geometric Convex Combinatorics" workshop, Oberwolfach, Germany.
  7. February 11, 2003, The Integral Basis Method and Extensions to Mixed-Integer Programming, Center for Operations Research and Econometrics (CORE), Université catholique de Louvain, Belgium.
  8. March 12, 2003, The Integral Basis Method and extensions to mixed-integer programming, 7th Combinatorial Optimization Workshop, Aussois, France.
  9. August 21, 2003, The Integral Basis Method and extensions, International Symposium on Mathematical Programming, Copenhagen, Denmark.
  10. September 3, 2003, Exact Primal Algorithms for General Integer and Mixed-Integer Linear Programs, OR 2003 (Symposium on Operations Research), Heidelberg, Germany.
  11. November 15, 2003, Integer Programming with Group Relaxations. Colloquium on Combinatorics, Magdeburg, Germany.
  12. June 15, 2004, A Cut-Reformulate-Augment-Branch Algorithm for Integer Programming, Center for Operations Research and Econometrics (CORE), Université catholique de Louvain, Louvain-la-Neuve, Belgium.
  13. March 16, 2005, Towards Primal-Dual Integer Programming. 9th Combinatorial Optimization Workshop, Aussois, France.
  14. December 19, 2005, FPTAS for Polynomial Optimization in Fixed Dimension. Optimization seminar, TU Darmstadt, Germany.
  15. January 23, 2006, FPTAS for Mixed-Integer Polynomial Optimization with a Fixed Number of Variables. ACM-SIAM Symposium on Discrete Algorithms (SODA06), Miami, FL, USA.
  16. March 24, 2006, FPTAS for Mixed-Integer Polynomial Optimization with a Fixed Number of Variables. Algebra–Geometry–Combinatorics Seminar, San Francisco State University, San Francisco, CA, USA.
  17. April 21, 2006, FPTAS for Mixed-Integer Polynomial Optimization with a Fixed Number of Variables. Optimization Seminar, University of California, Davis, CA, USA.
  18. May 19, 2006, Atomic Fibers, Integer Minkowski Programs, and the Design of Survivable Networks. 9th France Télécom Seminar on Optimization and Decision Aid, Nice, France.
  19. May 31, 2006, A Primal Variant of Barvinok's Algorithm based on irrational signed decompositions. IBM T. J. Watson Research Center, Yorktown Heights, NY, USA.
  20. June 6, 2006, Intermediate Integer Programming Representations using Value Disjunctions. MIP 2006, Miami, FL, USA.
  21. July 31, 2006, FPTAS for Mixed-Integer Polynomial Optimization in Fixed Dimension. International Symposium on Mathematical Programming, Rio de Janeiro, Brazil.
  22. September 8, 2006, Fully Polynomial-Time Approximation Schemes for Mixed-Integer Polynomial Optimization in Fixed Dimension. Operations Research 2006, Karlsruhe, Germany.
  23. November 16, 2006, A Primal Variant of Barvinok's Algorithm Based on Irrational Signed Decompositions. Kolloquium über Kombinatorik, University of Magdeburg, Germany.
  24. April 24, 2007, Integer Minkowski Programs and Network Survivability. INOC 2007 (International Network Optimization Conference), Spa, Belgium.
  25. June 1, 2007, New Variants of Barvinok's Algorithm for Computing the Ehrhart Series of Rational Polytopes. Discrete Mathematics & Representation Theory seminar, University of California, Davis, CA, USA.
  26. July 2, 2007, Counting Lattice Points in Polytopes with a New Version of LattE ("Macchiato"), Special Algebraic Statistics Seminar, University of California, Berkeley, CA, USA.
  27. September 7, 2007, Computing Parametric Counting Functions using Exact Half-Open Decompositions of Polyhedra, Algebra–Geometry–Combinatorics Seminar, San Francisco State University, San Francisco, CA, USA.
  28. October 8, 2007, The Computation of Ehrhart Polynomials of Matroid Polytopes, Discrete Mathematics & Representation Theory seminar, University of California, Davis, CA, USA.
  29. Oct. 27, 2007, Pareto Optima of Multicriteria Integer Linear Programs, West Coast Optimization Meeting, Kelowna, BC, Canada.
  30. Oct. 30, 2007, Ehrhart Polynomials of Matroid Polytopes, Discrete Mathematics Seminar, Simon Fraser University, Burnaby, BC, Canada.
  31. Oct. 31, 2007, Minimal Generating Families of Parametric Discrete and Polyhedral Sets with Applications to Survivable Network Design, Operations Research Seminar, Simon Fraser University, Surrey, BC, Canada.
  32. Nov. 2, 2007, Rational Generating Function Techniques for Integer Linear and Nonlinear Optimization, Sauder School of Business, University of British Columbia, Vancouver, BC, Canada.
  33. Nov. 5, 2007, New Rational Generating Function Techniques for Integer Programming, INFORMS Annual Meeting, Seattle, WA, USA.
  34. Nov. 17, 2007, The Computation of Ehrhart Polynomials of Matroid Polytopes, Colloquium on Combinatorics, Magdeburg, Germany.
  35. Dec. 7, 2007, The Computation of Ehrhart Polynomials of Matroid Polytopes, Sächsischer Geometrietag, Magdeburg, Germany.
  36. Jan. 29, 2008, Rational Generating Function Techniques for Integer Linear and Nonlinear Optimization, Combinatorics and Optimization Department, University of Waterloo, Canada.
  37. Feb. 5, 2008, Integer Linear and Non-Linear Optimization, Department of Mathematics, University of California, Davis, CA, USA.
  38. Feb. 7, 2008, Rational Generating Function Techniques for Integer Linear and Nonlinear Optimization, RUTCOR, Rutgers University, New Brunswick, NJ, USA.
  39. Feb. 29, 2008, Integer Linear and Non-Linear Optimization, Department of Mathematics, University of California, Berkeley, CA, USA.
  40. March 5, 2008, Integer Linear and Non-Linear Optimization, Institut für Mathematik, TU Berlin, Germany.
  41. July 15, 2008, An Implementation of the Barvinok--Woods Integer Projection Algorithm, Information Theory and Statistical Learning 2008, Las Vegas, NV, USA.
  42. Aug. 6, 2008, An Implementation of the Barvinok--Woods Integer Projection Algorithm, Mixed Integer Programming, New York, NY, USA.
  43. Sept. 18, 2008, An Implementation of the Barvinok--Woods Integer Projection Algorithm, Minisymposium "Algebraische und geometrische Kombinatorik", Jahrestagung der Deutschen Mathematiker-Vereinigung 2008, Erlangen, Germany.
  44. Oct. 4, 2008, An Implementation of the Barvinok--Woods Integer Projection Algorithm, AMS Fall Western Section Meeting, Vancouver, BC, Canada.
  45. Nov. 21, 2008, Nonlinear optimization via summation and integration, IMA Hot Topics Workshop: Mixed-Integer Nonlinear Optimization: Algorithmic Advances and Applications, Minneapolis, MN, USA.
  46. April 4, 2009, Efficient exact integration of polynomials over polytopes, AMS 2009 Spring Southeastern Section Meeting, Raleigh, NC.
  47. May 1, 2009, Rational generating functions and pure Nash equilibria of integer programming games (mini-talk), Bay Algorithmic Game Theory Symposium, UC Berkeley.
  48. May 20, 2009, Nonlinear Optimization via Summation and Integration, iCME Linear Algebra and Optimization Seminar, Stanford University, CA, USA.
  49. Aug. 26, 2009, The Summation Method for Integer and Continuous Optimization, International Symposium on Mathematical Programming, Chicago, IL.
  50. Sep. 9, 2009, The Summation Method for Integer and Continuous Optimization, Algebra–Geometry–Combinatorics Seminar at San Francisco State University, San Francisco, CA, USA.
  51. Talk at INFORMS 2009 (San Diego)
  52. Talk at Bay Area Discrete Math Day, October 17, 2009
  53. Talk at Berkeley Optimization Day, March 6, 2010
Matthias Koeppe (home page)