Publications of M. Padberg

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 Padberg M., in the category ALL (or show them all):   (Items found: 23)


2013 | 1998 | 1992 | 1991 | 1990 | 1989 | 1988 | 1987 | 1986 | 1984

2013  [top]
  • Hoffman K.L., Padberg M., Giovanni Rinaldi: Traveling Salesman Problem, in: Encyclopedia of Operations Research and Management Science - 3rd Edition, Gass S.I., Fu M.C. eds., Encyclopedia of Operations Research and Management Science, Springer New York Heidelberg Dordrecht London, 1573-1578, 2013

1998  [top]
  • Padberg M.: Approximating separable nonlinear functions via mixed zero-one programs, IASI-CNR, R. 476, 10/1998
  • Padberg M.: Almost perfect matrices and graphs, IASI-CNR, R. 478, 10/1998

1992  [top]
  • Padberg M., Sassano A.: The complexity of Matching with Bonds, Information Processing Letters, 1992

1991  [top]
  • Padberg M., Giovanni Rinaldi: 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., Giovanni Rinaldi: Addendum to Optimization of a 532-city symmetric traveling salesman problem by branch-and-cut, Operations Research Letters 9, 1990
  • Padberg M., Giovanni Rinaldi: An efficient algorithm for the minimum capacity cut problem, Mathematical Programming 47 (1), 19-36, 1990
  • Padberg M., Giovanni Rinaldi: Facet identification for the symmetric traveling salesman polytope, Mathematical Programming 47 (2), 219-257, 1990

1989  [top]

1988  [top]
  • Padberg M., Giovanni Rinaldi: Branch-and-cut approach to a variant of the traveling salesman problem, Journal of Guidance Control and Dynamics 11, 436-440, 1988
  • Padberg M., Giovanni Rinaldi: An efficient algorithm for the minimum capacity cut problem., IASI-CNR, R. 222, 07/1988
  • Padberg M., Giovanni Rinaldi: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling Salesman problems., IASI-CNR, R. 247, 12/1988

1987  [top]
  • Padberg M., Giovanni Rinaldi: Optimization of a 532-city symmetric traveling salesman problem by branch-and-cut, Operations Research Letters 6, 1-7, 1987
  • Padberg M., Giovanni Rinaldi: A branch-and-cut approach to a traveling salesman problem with side constraints., IASI-CNR, R. 203, 12/1987
  • Padberg M., Giovanni Rinaldi: Facet identification for the symmetric traveling salesman polytope., IASI-CNR, R. 204, 12/1987

1986  [top]

1984  [top]
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -