Planned Talks

• Something on discrete optimisation.
  Plenary talk, ISCO 2014, Lisbon, March 2014.
• Possibly a survey on quadratic 0-1 problems.
  Programme on Polynomial Optimisation, Cambridge, July 2013.
• The simple plant location problem: a case study in combinatorial optimisation.
  Keynote presentation, EURO-INFORMS Conference, Rome, July 2013.
• Probably something
  Seminar, L'Aquila, June 2013.

Talks Given in 2013

• Computing upper bounds for the stable set problem using Lagrangian relaxation.
  LANCS International Workshop on Discrete and Nonlinear Optimisation, Cardiff, May 2013. (Slides)
• Strengthening the reformulation-linearisation technique with cutting planes.
  Seminar, Pisa, April 2013. (Slides)
• Some unbounded convex sets arising in non-convex MIQP.
  Seminar, Groeningen, April 2013. (Slides)
• The travelling salesman problem.
  Seminar, Statistics Group, Lancaster University, January 2013. (Slides)
• On optimisation and ice-cream cones.
  Seminar, Statistics Group, Lancaster University, January 2013. (Slides)

Talks Given in 2012

• A new separation algorithm for the Boolean quadric and cut polytopes.
  Invited talk, ISMP XXI, Berlin, August 2012. (Slides)
• Cutting planes for a stochastic network loading problem.
  EURO, Vilnius, Lithuania, July 2012. (Slides)
• On the gap inequalities for the max-cut problem.
  EURO, Vilnius, Lithuania, July 2012. (Slides)
• A polyhedral approach to the single-row facility layout problem.
  APMOD, Paderborn, Germany, March 2012. (Slides)
• Second order cone programming and its applications.
  Seminar, Cardiff University, February 2012.

Talks Given in 2011

• Some unbounded convex sets arising in non-convex MIQP.
  Invited talk, MIP 2011, Waterloo, Canada, June 2011.
• Convex hulls for non-convex mixed-integer quadratic programs.
  Invited talk, SIAM Optimisation Conference, Darmstadt, May 2011.
• A tutorial on non-convex mixed integer nonlinear programming.
  LANCS Workshop on Complex Optimisation Problems, Lancaster, April 2011. (Slides)
• Convex relaxations of the stable set problem.
  Seminar, University of Milan, March 2011. (Slides)
• Reformulating mixed-integer quadratically-constrained quadratic programmes.
  Seminar, University of Milan, March 2011. (Slides)
• On optimisation and ice-cream cones.
  Seminar, Statistics Group, Lancaster University, February 2011.

Talks Given in 2010

• A tutorial on mixed-integer non-linear programming.
  Seminar, School of Mathematics, University of Edinburgh, November 2010.
• Reformulation of 0-1 quadratically constrained quadratic programs.
  Seminar, DEIS, University of Bologna, October 2010.
• Mixed-integer non-linear programming: a survey.
  Seminar, Department of Information Engineering, University of Padua, October 2010.
• An introduction to second-order cone programming.
  Seminar, Department of Information Engineering, University of Padua, September 2010.
• Integer quadratic quasi-polyhedra.
  IPCO XIV, Lausanne, June 2010.
• Generalised network design polyhedra.
  ECCO XXIII/CO 2010, Málaga, May 2010.
• Optimisation over cones.
  Invited lecture for the London Mathematical Society, Swansea, April 2010.
• The Travelling Salesman Problem.
  Invited lecture for the London Mathematical Society, Swansea, April 2010.
• Some convex sets related to non-convex quadratic optimisation problems.
  2nd LANCS Workshop on Discrete and Non-Linear Optimisation, Southampton, March 2010.
• An introduction to approximation algorithms.
  2nd LANCS Workshop on Heuristic Understanding, Cardiff, January 2010.

Talks Given in 2009

• A branch-and-cut algorithm for single-row facility layout problems.
  OR51, Warwick, United Kingdom, September 2009.
• A polyhedral approach to single-row facility layout problems.
  Invited talk, EURO XXIII, Bonn, July 2009.
• Fifty years of cutting planes.
  Invited talk, Integer Programming Workshop, London School of Economics, June 2009.
• The real world is non-linear... or is it?
  Seminar, LANCS meeting, London, May 2009.
• On non-convex quadratic programming with box constraints.
  Seminar, Faculty of Engineering, University of Tor Vergata, Rome, April 2009.
• Knapsack-based cutting planes for the max-cut problem.
  Invited talk, INOC, Pisa, April 2009.
• The Travelling Salesman Problem.
  Plenary talk at SCOR, Lancaster, United Kingdom, March 2009.
• Mixed-integer non-linear programming: a survey.
  1st LANCS Workshop on Discrete and Non-Linear Optimisation, Southampton, February 2009.
• Recent progress on knapsack-based cutting planes.
  Seminar, Math. Prog. Study Group, London School of Economics, January 2009.

Talks Given in 2008

• Separation algorithms for 0-1 knapsack polytopes.
  Invited talk, Bonn Workshop on Combinatorial Optimisation, November 2008.
• On mixed-integer quadratic programming with box constraints.
  Invited talk, MIP 2008, Columbia University, August 2008.
• Binary positive semidefinite matrices and some related polytopes.
  Seminar, IBM Watson Research Centre, New York, August 2008.
• Binary positive semidefinite matrices and associated integer polytopes.
  Integer Programming and Combinatorial Optimization (IPCO) conference, Bertinoro, Italy, May 2008.
• The max-cut and max-clique problems: linear versus semidefinite programming.
  Plenary talk at CO 2008, Warwick, United Kingdom, March 2008.
• Separation algorithms for 0-1 knapsack polytopes.
  Invited talk, 12th Aussois Workshop on Combinatorial Optimization, Aussois, France, January 2008.

Talks Given in 2007

• An introduction to conic programming.
  Seminar, DEIS, University of Bologna, October 2007.
• The max-cut problem: applications and algorithms.
  Plenary talk at Optimization 2007, Porto, July 2007.
• The max-stable set problem: recent progress.
  Plenary talk at INOC 2007, Spa, Belgium, April 2007.
• Stronger upper bounds for the maximum stable set problem.
  Seminar, Warwick Business School, February 2007.

Talks Given in 2006

• Semidefinite programming and combinatorial optimization.
  Seminar, Math. Prog. Study Group, London School of Economics, November 2006.
• Exploiting planarity in separation routines for the TSP.
  EURO XXI, Reykjavik, July 2006.
• Polyhedral analysis of vehicle routing problems.
  Invited talk, Spring School on Vehicle Routing, Montreal, May 2006.
• Semidefinite programming and combinatorial optimization.
  Plenary talk at CORS / Journeés de l'Optimisation, Montreal, May 2006.

Talks Given in 2005

• Algorithms for planar graphs.
  Seminar, DEIO, University of Valencia, Spain, December 2005.
• Comparing formulations of the capacitated vehicle routing problem.
  Journeés de l'Optimisation, Montreal, May 2005.
• Vehicle routing games.
  Seminar, Department of Computer Science, University of L'Aquila, Italy, March 2005.
• Planar graphs and the traveling salesman problem.
  Seminar, IASI-CNR, Rome, March 2005.
• Solving discrete optimization problems by branch-and-cut, Parts I and II.
  Lectures, Aarhus Business School, January 2005.
• Vehicle routing games.
  Seminar, Aarhus Business School, January 2005.

Talks Given in 2004

• Exploring the relationship between max-cut and stable set relaxations.
  Seminar, SMG, ULB, Brussels, September 2004.
• The traveling salesman problem: inequalities and separation.
  Seminar, Math. Prog. Study Group, London School of Economics, July 2004.
• Exploring the relationship between max-cut and stable set relaxations.
  Invited talk, Workshop on Combinatorial Optimization, Bertinoro, Italy, May 2004.
• The traveling salesman problem: inequalities and separation.
  Seminar, DEIOC, University of La Laguna, Spain, April 2004.
• A faster exact separation algorithm for simple comb inequalities.
  CO2004, Lancaster, March 2004.
• Solving discrete optimization problems by branch-and-cut.
  Seminar, School of Mathematics, University of Birmingham, March 2004.
• Computing good allocations for combinatorial optimization games.
  Invited talk, 8th Aussois Workshop on Combinatorial Optimization, Aussois, France, January 2004.

Talks Given in 2003

• The traveling salesman problem: inequalities and separation.
  Seminar, CORE, Catholic University of Louvain, December 2003.
• The traveling salesman problem: inequalities and separation.
  Seminar, University of Modena and Reggio Emilia, September 2003.
• Solving discrete optimization problems by branch-and-cut.
  Seminar, University of Modena and Reggio Emilia, September 2003.
• Fast algorithms for planar graphs, with applications.
  AIRO 2003, Venice, September 2003.
• Fast algorithms for planar graphs, Part I: cycles and cuts.
  ISMP, Copenhagen, August 2003.
• Solving discrete optimisation problems by branch-and-cut.
  Seminar, School of Mathematical Sciences, Brunel University, March 2003.
• Good allocations for traveling salesman and vehicle routing games.
  Invited talk, CORAL II, Puerto de la Cruz, Tenerife, February 2003.
• On traveling salesman games.
  Seminar, School of Management, University of Edinburgh, January 2003.

Talks Given in 2002

• A polyhedral approach to the linear arrangement problem.
  IFORS/ORS, Edinburgh, July 2002.
• On clutters, cutting planes and combs.
  Plenary talk at Integer Programming Conference in honour of Egon Balas, CMU, Pittsburgh, June 2002.
• Polynomial-time separation of simple comb inequalities.
  Integer Programming and Combinatorial Optimization (IPCO), MIT, May 2002.
• Polynomial-time separation of simple comb inequalities.
  Invited talk, 6th Aussois Workshop on Combinatorial Optimization, Aussois, France, January 2002.

Talks Given in 2001

• A branch-and-cut algorithm for the capacitated vehicle routing problem.
  AIRO 2001, Villasimius, Sardinia, August 2001.
• Primal separation algorithms.
  Seminar, SMG, ULB, Brussels, April 2001.
• Primal cutting plane algorithms revisited.
  Invited talk, 5th Aussois Workshop on Combinatorial Optimization, Aussois, France, March 2001.

Talks Given in 2000

• {0, 1/2}-cuts, binary split cuts and the traveling salesman problem.
  ISMP, Georgia Tech, August 2000.
• Complexity of a separation problem.
  CO2000, Greenwich, London, July 2000.
• On disjunctive cuts for combinatorial optimization.
  Invited talk, 4th Aussois Workshop on Combinatorial Optimization, Aussois, France, March 2000.

Talks Given Before 2000

• The polyhedral approach to the TSP.
  Invited talk, TSP Workshop, Southampton, September 1999.
• Mod-2 cuts for the weighted stable set problem.
  SOR99, Magdeburg, Germany, September 1999.
• Mod-2 cuts for stable set polytopes.
  Invited talk, 3rd Aussois Workshop on Combinatorial Optimization, Aussois, France, March 1999.
• On comb separation for the TSP.
  Invited talk, Workshop on Combinatorial Optimization, Oberwolfach, January 1999.
• Rank-1 Chvátal-Gomory cuts: separation and strengthening.
  Seminar, GSIA, Carnegie Mellon University, September 1998.
• Multistar inequalities for vehicle routing.
  CO98, Brussels, April 1998.
• On the separation of maximally violated mod-k cuts.
  Invited talk, 2nd Aussois Workshop on Combinatorial Optimization, Aussois, France, February 1998.
• New cutting planes for vehicle routing problems.
  CO96, London, March 1996.
• Solving vehicle routing problems with deadline classes.
  OR37, Canterbury, September 1995.

Last updated: May 2013.

Back to home page.