OPTIMIZATION, DISCRETE MATHEMATICS AND APPLICATIONS (OPTIMA)

This page shows the publications appeared in journals, collections, periodic conferences, and books whose authors are currently affiliated with the Institute. The publications are grouped by research topic and then by publication site. Finally, each publication site is linked to the corresponding article list. The numbers in square brackets give the total number of publications associated with the corresponding item.

Mathematical Programming
  • Bonato T., Jünger M., Reinelt G., Rinaldi G.: Lifting and Separation Procedures for the Cut Polytope, Mathematical Programming 146, 351-378, 2014
  • Frangioni A., Gorgone E.: Bundle methods for sum-functions with "easy" components: applications to multicommodity network design, Mathematical Programming 145(1), 133-161, 2014
  • Grippo L., Palagi L., Piacentini M., Piccialli V., Rinaldi G.: SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances, Mathematical Programming 136, 353-373, 2012
  • Rendl F., Rinaldi G., Wiegele A.: Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations, Mathematical Programming 121, 307-335, 2010
  • Frangioni A., Claudio Gentile: Perspective cuts for a class of convex 0-1 mixed integer programs, Mathematical Programming 106 (2), 225-236, 2006
  • Frangioni A., Lodi A., Rinaldi G.: New Approaches for Optimizing over the Semimetric Polytope, Mathematical Programming 104, 375-388, 2005
  • Eisenbrand F., Rinaldi G., Paolo Ventura: Primal separation for 0/1 polytopes, Mathematical Programming 95, 475-491, 2003
  • McCormick S.T., Rao M.R., Rinaldi G.: Easy and Difficult Objective Functions for Max Cut, Mathematical Programming 94, 459-466, 2003
  • Rinaldi G., Voigt U., Woeginger G.J.: The mathematics of playing golf, or: A new class of difficult non-linear mixed integer programs, Mathematical Programming 93, 77-86, 2002
  • Gallo G., Claudio Gentile, Pretolani D., Rago D.: Max Horn SAT and the Minimum Cut Problem in Directed Hypergraphs, Mathematical Programming 80, 213-237, 1998
  • Brunetta L., Conforti M., Rinaldi G.: A branch-and-cut algorithm for the resolution of the equicut problem, Mathematical Programming 78, 243-263, 1997
  • Naddef D., Rinaldi G.: The graphical relaxation: a new framework for the symmetric traveling salesman polytope, Mathematical Programming 58, 53-88, 1993
  • Naddef D., Rinaldi G.: The graphical relaxation: A new framework for the symmetric traveling salesman polytope, Mathematical Programming, 1992
  • Naddef D., Rinaldi G.: The symmetric traveling salesman polytope and its graphical relaxation: composition of valid inequalities, Mathematical Programming 51 (3), 359-400, 1991
  • Padberg M., Rinaldi G.: An efficient algorithm for the minimum capacity cut problem, Mathematical Programming 47 (1), 19-36, 1990
  • Padberg M., Rinaldi G.: Facet identification for the symmetric traveling salesman polytope, Mathematical Programming 47 (2), 219-257, 1990
back
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -