Publications of Giovanni Rinaldi

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  ALL, with author Rinaldi G., in the category Journal Articles (or show them all):   (Items found: 38)


2014 | 2013 | 2012 | 2010 | 2009 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2000 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1991 | 1990 | 1989 | 1988 | 1987 | 1986

2014  [top]

2013  [top]

2012  [top]

2010  [top]
  • Rendl F., Rinaldi G., Wiegele A.: Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations, Mathematical Programming 121, 307-335, 2010

2009  [top]
  • Buchheim C., Rinaldi G.: Terse integer linear programs for boolean optimization, Journal on Satisfiability, Boolean Modeling and Computation 6, 121-139, 2009

2007  [top]
  • Buchheim C., Rinaldi G.: Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case, SIAM Journal on Optimization 18 (4), 1398-1413, 2007
  • Naddef D., Rinaldi G.: The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation, Mathematics of Operations Research 32, 233-256, 2007

2006  [top]

2005  [top]

2004  [top]

2003  [top]

2002  [top]
  • Brewer D.D., Garrett S.B., Rinaldi G.: Free-Listed Items are Effective Cues for Eliciting Additional Items in Semantic Domains, Applied Cognitive Psychology 16, 343-358, 2002
  • 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

2000  [top]

1997  [top]

1996  [top]

1995  [top]

1994  [top]
  • De Simone C., Rinaldi G.: A Cutting Plane Algorithm for the Max-cut Problem, Optimization Methods & Software 3, 195-214, 1994

1993  [top]
  • Naddef D., Rinaldi G.: The graphical relaxation: a new framework for the symmetric traveling salesman polytope, Mathematical Programming 58, 53-88, 1993

1992  [top]
  • Naddef D., Rinaldi G.: The graphical relaxation: A new framework for the symmetric traveling salesman polytope, Mathematical Programming, 1992
  • Naddef D., Rinaldi G.: The crown inequalities for the symmetric traveling salesman polytope, Mathematics of Operations Research 17 (2), 308-326, 1992

1991  [top]
  • 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.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Review 33 (1), 60-100, 1991

1990  [top]
  • Padberg M., Rinaldi G.: Addendum to Optimization of a 532-city symmetric traveling salesman problem by branch-and-cut, Operations Research Letters 9, 1990
  • 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

1989  [top]
  • Padberg M., Rinaldi G.: A Branch-and-cut approach to a traveling salesman problem with side constraints, Management Science 35, 1393-1412, 1989

1988  [top]
  • Bianco L., Ricciardelli S., Rinaldi G., Sassano A.: Scheduling tasks with sequence dependent processing times, Naval Research Logistics Quarterly 35, 177-184, 1988
  • Padberg M., Rinaldi G.: Branch-and-cut approach to a variant of the traveling salesman problem, Journal of Guidance Control and Dynamics 11, 436-440, 1988

1987  [top]
  • Padberg M., Rinaldi G.: Optimization of a 532-city symmetric traveling salesman problem by branch-and-cut, Operations Research Letters 6, 1-7, 1987

1986  [top]
  • Rinaldi G.: A projective method for linear programming with box-type constraints, Algorithmica 1, 517-527, 1986
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -