| Combinatorial optimization WJ Cook, WH Cunningham, WR Pulleyblank, A Schrijver Unpublished manuscript 10, 75-93, 1994 | 5316* | 1994 |
| On the capacitated vehicle routing problem TK Ralphs, L Kopman, WR Pulleyblank, LE Trotter Mathematical programming 94, 343-359, 2003 | 568 | 2003 |
| 50 Years of integer programming 1958-2008: From the early years to the state-of-the-art M Jünger, TM Liebling, D Naddef, GL Nemhauser, WR Pulleyblank, ... Springer Science & Business Media, 2009 | 529 | 2009 |
| Editors, 50 Years of Integer Programming 1958-2008 M Junger, TM Liebling, D Naddef, GL Nemhauser, WR Pulleybank, ... Berlin: Springer, 2010 | 317 | 2010 |
| Minimum-weight two-connected spanning networks CL Monma, BS Munson, WR Pulleyblank Mathematical Programming 46, 153-171, 1990 | 257 | 1990 |
| Chapter V polyhedral combinatorics WR Pulleyblank Handbooks in operations research and management science 1, 371-446, 1989 | 254 | 1989 |
| Facets of I-matching polyhedra W Pulleyblank, J Edmonds Hypergraph Seminar: Ohio State University 1972, 214-242, 2006 | 241 | 2006 |
| The precedence-constrained asymmetric traveling salesman polytope E Balas, M Fischetti, WR Pulleyblank Mathematical programming 68, 241-265, 1995 | 229 | 1995 |
| Weakly bipartite graphs and the max-cut problem M Grötschel, WR Pulleyblank Operations research letters 1 (1), 23-27, 1981 | 229 | 1981 |
| Total dual integrality and integer polyhedra FR Giles, WR Pulleyblank Linear algebra and its applications 25, 191-196, 1979 | 191 | 1979 |
| Brick decompositions and the matching rank of graphs J Edmonds, WR Pulleyblank, L Lovász Combinatorica 2, 247-274, 1982 | 164 | 1982 |
| Halin graphs and the travelling salesman problem G Cornuéjols, D Naddef, WR Pulleyblank Mathematical programming 26 (3), 287-294, 1983 | 159 | 1983 |
| The perfectly matchable subgraph polytope of a bipartite graph E Balas, W Pulleyblank Networks 13 (4), 495-516, 1983 | 152 | 1983 |
| Balanced optimization problems S Martello, WR Pulleyblank, P Toth, D De Werra Operations Research Letters 3 (5), 275-278, 1984 | 149 | 1984 |
| Steiner trees, connected domination and strongly chordal graphs K White, M Farber, W Pulleyblank Networks 15 (1), 109-124, 1985 | 143 | 1985 |
| Column generation and the airline crew pairing problem R Anbil, JJ Forrest, WR Pulleyblank Documenta Mathematica 3 (1), 677, 1998 | 141 | 1998 |
| Method and apparatus for securely determining aspects of the history of a good TJ Chainer, CA Greengard, WR Pulleyblank, CP Tresser, CW Wu US Patent 6,501,390, 2002 | 140 | 2002 |
| Clique tree inequalities and the symmetric travelling salesman problem M Grötschel, WR Pulleyblank Mathematics of operations research 11 (4), 537-569, 1986 | 134 | 1986 |
| A matching problem with side conditions G Cornuéjols, W Pulleyblank Discrete Mathematics 29 (2), 135-159, 1980 | 124 | 1980 |
| Precedence constrained routing and helicopter scheduling: heuristic design MT Fiala Timlin, WR Pulleyblank Interfaces 22 (3), 100-111, 1992 | 113 | 1992 |
William CookUniversity of Waterlooכתובת אימייל מאומתת בדומיין uwaterloo.ca