| The partition problem S Chopra, MR Rao Mathematical Programming 59 (1-3), 87-115, 1993 | 330 | 1993 |
| The bottleneck transportation problem RS Garfinkel, MR Rao Naval Research Logistics Quarterly 18 (4), 465-472, 1971 | 221 | 1971 |
| The Steiner tree problem I: Formulations, compositions and extension of facets S Chopra, MR Rao Mathematical Programming 64 (1-3), 209-229, 1994 | 213 | 1994 |
| Solving the Steiner tree problem on a graph using branch and cut S Chopra, ER Gorres, MR Rao ORSA Journal on Computing 4 (3), 320-335, 1992 | 161 | 1992 |
| An algorithm for the fixed-charge assigning users to sources problem AW Neebe, MR Rao Journal of the Operational Research Society 34 (11), 1107-1113, 1983 | 154 | 1983 |
| An algorithm for the m-median plant location problem RS Garfinkel, AW Neebe, MR Rao Transportation Science 8 (3), 217-236, 1974 | 133 | 1974 |
| The travelling salesman problem and a class of polyhedra of diameter two MW Padberg, MR Rao Mathematical Programming 7 (1), 32-45, 1974 | 121 | 1974 |
| The m-Center Problem: Minimax Facility Location RS Garfinkel, AW Neebe, MR Rao Management Science 23 (10), 1133-1142, 1977 | 115 | 1977 |
| On the multiway cut polyhedron S Chopra, MR Rao Networks 21 (1), 51-89, 1991 | 110 | 1991 |
| The equipartition polytope. I: formulations, dimension and basic facets M Conforti, MR Rao, A Sassano Mathematical Programming 49 (1-3), 49-70, 1990 | 96 | 1990 |
| Decomposition of balanced matrices M Conforti, G Cornuéjols, MR Rao Journal of Combinatorial Theory, Series B 77 (2), 292-406, 1999 | 90 | 1999 |
| The Steiner tree problem II: Properties and classes of facets S Chopra, MR Rao Mathematical Programming 64 (1-3), 231-246, 1994 | 88 | 1994 |
| Easy and difficult objective functions for max cut ST McCormick, MR Rao, G Rinaldi Mathematical programming 94 (2-3), 459-466, 2003 | 71 | 2003 |
| Balanced matrices M Conforti, G Corneujols, A Kapoor, MR Rao, K Vuskovic CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP, 1994 | 54 | 1994 |
| The equipartition polytope. II: valid inequalities and facets M Conforti, MR Rao, A Sassano Mathematical Programming 49 (1-3), 71-90, 1990 | 54 | 1990 |
| Facets of the k-partition polytope S Chopra, MR Rao Discrete Applied Mathematics 61 (1), 27-48, 1995 | 53 | 1995 |
| Structural properties and recognition of restricted and strongly unimodular matrices M Conforti, MR Rao Mathematical Programming 38 (1), 17-27, 1987 | 53 | 1987 |
| Adjacency of the Traveling Salesman Tours and Vertices MR Rao SIAM Journal on Applied Mathematics 30 (2), 191-198, 1976 | 44 | 1976 |
| The Russian method for linear inequalities III: Bounded integer programming MW Padberg, MR Rao | 41 | 1981 |
| Structural properties and decomposition of linear balanced matrices M Conforti, MR Rao Mathematical Programming 55 (1-3), 129-168, 1992 | 40 | 1992 |
