Activities

• 1st Joint IMA/ORS Conference on the Mathematics of Operational Research

  Activity: Participating in or organising an event types › Participation in conference -Mixed Audience

• Binary positive semidefinite matrices and some related polytopes

  Activity: Talk or presentation types › Invited talk

• Recent progress on knapsack-based cutting planes

  Activity: Talk or presentation types › Invited talk

• Fifty years of cutting planes

  Activity: Talk or presentation types › Invited talk

• Some unbounded convex sets arising in non-convex MIQP

  Activity: Talk or presentation types › Invited talk

• Strengthening the reformulation-linearisation technique with cutting planes

  Activity: Talk or presentation types › Invited talk

• Algorithms for planar graphs

  Activity: Talk or presentation types › Invited talk

• Planar graphs and the traveling salesman problem

  Activity: Talk or presentation types › Invited talk

• Solving discrete optimization problems by branch-and-cut

  Activity: Talk or presentation types › Invited talk

• The traveling salesman problem: inequalities and separation

  Activity: Talk or presentation types › Invited talk

• Solving discrete optimization problems by branch-and-cut

  Activity: Talk or presentation types › Invited talk

• The traveling salesman problem: inequalities and separation

  Activity: Talk or presentation types › Invited talk

• Solving discrete optimization problems by branch-and-cut

  Activity: Talk or presentation types › Invited talk

• Solving discrete optimisation problems by branch-and-cut

  Activity: Talk or presentation types › Invited talk

• Primal separation algorithms

  Activity: Talk or presentation types › Invited talk

• The traveling salesman problem: inequalities and separation

  Activity: Talk or presentation types › Invited talk

• 30th European Conference on Operational Research (EURO XXX)

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 27th European Conference on Operational Research (EURO XXVII)

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 17th British-French-German Optimisation Conference (BFG 2015)

  Activity: Participating in or organising an event types › Participation in conference - Academic

• University of Pisa

  Activity: Visiting an external institution types › Visiting an external academic institution

• 2nd Aussois Workshop on Combinatorial Optimisation

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 3rd Aussois Workshop on Combinatorial Optimization

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 7th Conference on Integer Programming and Combinatorial Optimization (IPCO VII)

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 4th Aussois Workshop on Combinatorial Optimisation

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 12th Combinatorial Optimisation Conference (CO2000)

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 17th International Symposium on Mathematical Programming (ISMP)

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 5th Aussois Workshop on Combinatorial Optimization

  Activity: Participating in or organising an event types › Participation in conference - Academic

• Integer Programming Conference in Honor of Egon Balas

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 16th Conference of the International Federation of Operational Research Societies (IFORS)

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 2nd Conference on Routing and Location (CORAL)

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 12th Aussois Workshop on Combinatorial Optimisation

  Activity: Participating in or organising an event types › Participation in conference - Academic

• Bonn Workshop on Combinatorial Optimisation

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 4th International Network Optimization Conference (INOC 2009)

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 23rd European Conference on Operational Research (EURO XXIII)

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 25th European Conference on Operational Research (EURO XXV)

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 60th Annual Conference of the Operational Research Society (OR60)

  Activity: Participating in or organising an event types › Participation in conference -Mixed Audience

• 34th Conference of the European Chapter on Combinatorial Optimization (ECCO XXXIV)

  Activity: Participating in or organising an event types › Participation in conference - Academic

• 10th International Conference on Applied Mathematical Optimization and Modelling (APMOD 2012)

  Activity: Participating in or organising an event types › Participation in conference - Academic

Research outputs

• Polyhedral theory for arc routing problems

  Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

• The rural postman problem with deadline classes

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• A cutting plane algorithm for the general routing problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• On the separation of maximally violated mod-k cuts

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Separating a superclass of comb inequalities in planar graphs

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• The general routing polyhedron: a unifying framework

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• New inequalities for the general routing problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• On the separation of split cuts and related inequalities

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• On the separation of maximally violated mod-k cuts

  Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

• Totally tight Chvatal-Gomory cuts

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Strengthening Chvatal-Gomory cuts and Gomory fractional cuts

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Polynomial-time separation of simple comb inequalities

  Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

• On disjunctive cuts for combinatorial optimization

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Primal cutting plane algorithms revisited

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Multistars, partial multistars and the capacitated vehicle routing problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• An augment-and-branch-and-cut framework for mixed 0-1 programming

  Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

• Binary clutter inequalities for integer programs

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Primal separation algorithms

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• A new branch-and-cut algorithm for the capacitated vehicle routing problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• A faster exact separation algorithm for blossom inequalities

  Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed)

• A fast algorithm for minimum weight odd cuts and circuits in planar graphs

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Polynomial-time separation of a superclass of simple comb inequalities

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Odd minimum cut-sets and b-matchings revisited

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Exploiting planarity in separation routines for the symmetric travelling salesman problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• A branch-and-cut algorithm for the capacitated open vehicle routing problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Local and global lifted cover inequalities for the multidimensional knapsack problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Binary positive semidefinite matrices and associated integer polytopes

  Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

• An application of the Lovasz-Schrijver M(K,K) operator to the stable set problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• New techniques for cost sharing in combinatorial optimization games

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Integer quadratic quasi-polyhedra

  Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

• Decorous lower bounds for minimum linear arrangement

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Small bipartite subgraph polytopes

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• On a class of metrics related to graph layout problems

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Generalised network design polyhedra

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Gap inequalities for non-convex mixed-integer quadratic programs

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• On the membership problem for the {0, 1/2}-closure

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Separation algorithms for 0-1 knapsack polytopes

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Binary positive semidefinite matrices and associated integer polytopes

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Complexity results for the gap inequalities for the max-cut problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Gap inequalities for the max-cut problem: a cutting-plane algorithm

  Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

• A polyhedral approach to the single row facility layout problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Unbounded convex sets for non-convex mixed-integer quadratic programming

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Iterated Chvatal-Gomory cuts and the geometry of numbers

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• A new separation algorithm for the Boolean quadric and cut polytopes

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Cutting planes for RLT relaxations of mixed 0-1 polynomial programs

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Review of "Integer Programming” by Conforti et al.

  Research output: Contribution to Journal/Magazine › Book/Film/Article review › peer-review

• Strengthening Chvátal-Gomory cuts for the stable set problem

  Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

• Some hard combinatorial optimisation problems from mobile wireless communications

  Research output: Contribution to conference - Without ISBN/ISSN › Conference paper › peer-review

• A two-level graph partitioning problem arising in mobile wireless communications

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Projection results for the k-partition problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• New valid inequalities and facets for the simple plant location problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• A note on the 2-circulant inequalities for the max-cut problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• On lifted cover inequalities: a new lifting procedure with unusual properties

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• New valid inequalities for the fixed-charge and single-node flow polytopes

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Facets from gadgets

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• A cut-and-branch algorithm for the quadratic knapsack problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• On matroid parity and matching polytopes

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• The stable set problem: clique and nodal inequalities revisited

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Lifting the knapsack cover inequalities for the knapsack polytope

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Strengthened clique-family inequalities for the stable set polytope  

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• A separation algorithm for the simple plant location problem

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• The Boolean quadric polytope

  Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review

• A new lower bound for the minimum linear arrangement of a graph

  Research output: Contribution to Journal/Magazine › Journal article › peer-review

• Lower bounds for the minimum linear arrangement of a graph

  Research output: Contribution to Journal/Magazine › Journal article › peer-review