William R. Pulleyblank

Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey: Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. 124(1-2): 1-6 (2010)

Sylvia C. Boyd, William R. Pulleyblank: Facet Generating Techniques. Bonn Workshop of Combinatorial Optimization 2008: 33-55

William R. Pulleyblank: Mathematical sciences in the nineties. IBM Journal of Research and Development 47(1): 89-96 (2003)

Ted K. Ralphs, L. Kopman, William R. Pulleyblank, Leslie E. Trotter Jr.: On the capacitated vehicle routing problem. Math. Program. 94(2-3): 343-359 (2003)

Gérard Cornuéjols, William R. Pulleyblank: Integer programming. Math. Program. 98(1-3): 1-2 (2003)

William R. Pulleyblank: Terascale Computing and BlueGene. ICCD 2003

Arlette Gaillard, Heinz Gröflin, Alan J. Hoffman, William R. Pulleyblank: On the submodular matrix representation of a digraph. Theor. Comput. Sci. 287(2): 563-570 (2002)

Henrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven Noble, William R. Pulleyblank: Preface. Annals OR 107(1-4): 13 (2001)

Gérard Cornuéjols, William R. Pulleyblank: Foreword. Discrete Applied Mathematics 89(1-3): 1-2 (1998)

Sándor P. Fekete, William R. Pulleyblank: Traveling the Boundary of Minkowski Sums. Inf. Process. Lett. 66(4): 171-174 (1998)

William R. Pulleyblank: The Airline Crew Pairing Optimization Problem. ISTCS 1996: 189

Michael Jünger, William R. Pulleyblank: New Primal and Dual Matching Heuristics. Algorithmica 13(4): 357-386 (1995)

B. Gamble, William R. Pulleyblank, B. Reed, F. Bruce Shepherd: Right angle free subsets in the plane. Graphs and Combinatorics 11(2): 121-129 (1995)

Egon Balas, Matteo Fischetti, William R. Pulleyblank: The precedence-constrained asymmetric traveling salesman polytope. Math. Program. 68: 241-265 (1995)

William R. Pulleyblank: Two Steiner tree packing problems (Extended Abstract). STOC 1995: 383-387

Eric V. Denardo, Alan J. Hoffman, Todd Mackenzie, William R. Pulleyblank: A nonlinear allocation problem. IBM Journal of Research and Development 38(3): 301-306 (1994)

Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan: The minimum latency problem. STOC 1994: 163-171

Sándor P. Fekete, William R. Pulleyblank: Area Optimization of Simple Polygons. Symposium on Computational Geometry 1993: 173-182

William R. Pulleyblank, F. Bruce Shepherd: Formulations for the stable set polytope of a claw-free graph. IPCO 1993: 267-279

Sylvia C. Boyd, William R. Pulleyblank: Optimizing over the subtour polytope of the travelling salesman problem. Math. Program. 49: 163-187 (1991)

A. B. Gamble, Andrew R. Conn, William R. Pulleyblank: A network penalty method. Math. Program. 50: 53-73 (1991)

Clyde L. Monma, Beth Spellman Munson, William R. Pulleyblank: Minimum-Weight Two-Connected Spanning Networks. Math. Program. 46: 153-171 (1990)

Ravi Kannan, William R. Pulleyblank (Eds.): Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, Waterloo, Ontorio, Canada, May 28-30 1990. University of Waterloo Press 1990, isbn 0-88898-099-X

Egon Balas, William R. Pulleyblank: The perfectly matchable subgraph polytope of an arbitrary graph. Combinatorica 9(4): 321-337 (1989)

Jean-Marie Bourjolly, William R. Pulleyblank: König-Egerváry graphs, 2-bicritical graphs and fractional matchings. Discrete Applied Mathematics 24(1-3): 63-82 (1989)

Noga Alon, Meir Katchalski, William R. Pulleyblank: Cutting Disjoint Disks by Straight Lines. Discrete & Computational Geometry 4: 239-243 (1989)

Noga Alon, Meir Katchalski, William R. Pulleyblank: The Maximum Size of a Convex Polygon in a Restricted Set in the Plane. Discrete & Computational Geometry 4: 245-251 (1989)

Charles J. Colbourn, William R. Pulleyblank, Alexander Rosa: Hybrid triple systems and cubic feedback sets. Graphs and Combinatorics 5(1): 15-28 (1989)

Charles J. Colbourn, William R. Pulleyblank: Matroid Steiner problems, the Tutte polynomial and network reliability. J. Comb. Theory, Ser. B 47(1): 20-31 (1989)

Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank: The Traveling Salesman Problem in Graphs with 3-Edge Cutsets. J. ACM 32(2): 383-410 (1985)

Kevin White, Martin Farber, William R. Pulleyblank: Steiner trees, connected domination and strongly chordal graphs. Networks 15(1): 109-124 (1985)

Denis Naddef, William R. Pulleyblank: Hamiltonicity in (0-1)-polyhedra. J. Comb. Theory, Ser. B 37(1): 41-52 (1984)

Gérard Cornuéjols, William R. Pulleyblank: Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem. Combinatorica 3(1): 35-52 (1983)

Egon Balas, William R. Pulleyblank: The perfectly matchable subgraph polytope of a bipartite graph. Networks 13(4): 495-516 (1983)

Jack Edmonds, László Lovász, William R. Pulleyblank: Brick decompositions and the matching rank of graphs. Combinatorica 2(3): 247-274 (1982)

Denis Naddef, William R. Pulleyblank: Matchings in regular graphs. Discrete Mathematics 34(3): 283-291 (1981)

Denis Naddef, William R. Pulleyblank: Hamiltonicity and combinatorial polyhedra. J. Comb. Theory, Ser. B 31(3): 297-312 (1981)

William R. Pulleyblank: Min-max relations and combinatorial algorithms. AFIPS National Computer Conference 1973: 453