![]() |
| 2009 | ||
|---|---|---|
| 11 | EE | Karla Hoffman, Manfred Padberg: Set Covering, Packing and Partitioning Problems. Encyclopedia of Optimization 2009: 3482-3486 |
| 2007 | ||
| 10 | EE | Manfred Padberg: Mixed-integer programming - 1968 and thereafter. Annals OR 149(1): 163-175 (2007) |
| 2005 | ||
| 9 | EE | Manfred Padberg: Classical Cuts for Mixed-Integer Programming and Branch-and-Cut. Annals OR 139(1): 321-352 (2005) |
| 2001 | ||
| 8 | EE | Manfred Padberg: Almost Perfect Matrices and Graphs. Math. Oper. Res. 26(1): 1-18 (2001) |
| 2000 | ||
| 7 | EE | Manfred Padberg: Approximating separable nonlinear functions via mixed zero-one programs. Oper. Res. Lett. 27(1): 1-5 (2000) |
| 1997 | ||
| 6 | EE | Manfred Padberg, Ting-Yi Sung: An analytic symmetrization of max flow-min cut. Discrete Mathematics 165-166: 531-545 (1997) |
| 1993 | ||
| 5 | EE | Manfred Padberg: Lehman's forbidden minor characterization of ideal 0-1 matrices. Discrete Mathematics 111(1-3): 409-420 (1993) |
| 1991 | ||
| 4 | Manfred Padberg, Ting-Yi Sung: An analytical comparison of different formulations of the travelling salesman problem. Math. Program. 52: 315-357 (1991) | |
| 1990 | ||
| 3 | Manfred Padberg, Giovanni Rinaldi: An Efficient Algorithm for the Minimum Capacity Cut Problem. Math. Program. 47: 19-36 (1990) | |
| 2 | Manfred Padberg, Giovanni Rinaldi: Facet Identification for the Symmetric Traveling Salesman Polytope. Math. Program. 47: 219-257 (1990) | |
| 1989 | ||
| 1 | Manfred Padberg, Antonio Sassano: The Complexity of Matching with Bonds. Inf. Process. Lett. 32(6): 297-300 (1989) | |
| 1 | Karla Hoffman | [11] |
| 2 | Giovanni Rinaldi | [2] [3] |
| 3 | Antonio Sassano | [1] |
| 4 | Ting-Yi Sung | [4] [6] |