default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam R. Pulleyblank
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c11]Max Bassett, Blake Newton, Joseph Schlessinger, Jacob Schmidt, Scott Lynch, Patrick Kuiper, Ryan Miller, Steven Morse, James Pleuss, Travis Russell, William R. Pulleyblank:
Condorcet Optimal Clustering with Delaunay Triangulation: Climate Zones and World Happiness Insights. SBP-BRiMS 2019: 81-91- 2014
- [c10]Paulo Shakarian, Joseph Salmento, William R. Pulleyblank, John Bertetto:
Reducing gang violence through network influence based targeting of social programs. KDD 2014: 1829-1836 - 2013
- [i2]Brian Macdonald, William R. Pulleyblank:
Realignment in the NHL, MLB, the NFL, and the NBA. CoRR abs/1302.4735 (2013) - 2010
- [j47]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) - [e2]Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey:
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art. Springer 2010, ISBN 978-3-540-68274-5 [contents]
2000 – 2009
- 2008
- [c9]Sylvia C. Boyd, William R. Pulleyblank:
Facet Generating Techniques. Bonn Workshop of Combinatorial Optimization 2008: 33-55 - 2003
- [j46]William R. Pulleyblank:
Mathematical sciences in the nineties. IBM J. Res. Dev. 47(1): 89-96 (2003) - [j45]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) - [j44]Gérard Cornuéjols, William R. Pulleyblank:
Integer programming. Math. Program. 98(1-3): 1-2 (2003) - [c8]William R. Pulleyblank:
Terascale Computing and BlueGene. ICCD 2003 - 2002
- [j43]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) - 2001
- [j42]Henrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven D. Noble, William R. Pulleyblank:
Preface. Ann. Oper. Res. 107(1-4): 13 (2001)
1990 – 1999
- 1998
- [j41]Rainer E. Burkard, Toshihide Ibaraki, William R. Pulleyblank:
Preface: Mathematics of Industrial Systems III. Ann. Oper. Res. 76: 0 (1998) - [j40]Gérard Cornuéjols, William R. Pulleyblank:
Foreword. Discret. Appl. Math. 89(1-3): 1-2 (1998) - [j39]Sándor P. Fekete, William R. Pulleyblank:
Traveling the Boundary of Minkowski Sums. Inf. Process. Lett. 66(4): 171-174 (1998) - 1996
- [c7]William R. Pulleyblank:
The Airline Crew Pairing Optimization Problem. ISTCS 1996: 189 - 1995
- [j38]Michael Jünger, William R. Pulleyblank:
New Primal and Dual Matching Heuristics. Algorithmica 13(4): 357-386 (1995) - [j37]B. Gamble, William R. Pulleyblank, Bruce A. Reed, F. Bruce Shepherd:
Right angle free subsets in the plane. Graphs Comb. 11(2): 121-129 (1995) - [j36]Egon Balas, Matteo Fischetti, William R. Pulleyblank:
The precedence-constrained asymmetric traveling salesman polytope. Math. Program. 68: 241-265 (1995) - [c6]William R. Pulleyblank:
Two Steiner tree packing problems (Extended Abstract). STOC 1995: 383-387 - 1994
- [j35]Eric V. Denardo, Alan J. Hoffman, Todd Mackenzie, William R. Pulleyblank:
A nonlinear allocation problem. IBM J. Res. Dev. 38(3): 301-306 (1994) - [j34]David Hartvigsen, William R. Pulleyblank:
Outer-Facial Graphs and the Traveling Salesman Problem. SIAM J. Optim. 4(3): 676-689 (1994) - [c5]Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan:
The minimum latency problem. STOC 1994: 163-171 - [i1]Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan:
On the minimum latency problem. CoRR abs/math/9409223 (1994) - 1993
- [c4]Sándor P. Fekete, William R. Pulleyblank:
Area Optimization of Simple Polygons. SCG 1993: 173-182 - [c3]William R. Pulleyblank, F. Bruce Shepherd:
Formulations for the stable set polytope of a claw-free graph. IPCO 1993: 267-279 - 1992
- [p1]Jean-Marie Bourjolly, Peter L. Hammer, William R. Pulleyblank, Bruno Simeone:
Boolean-Combinatorial Bounding of Maximum 2-Satisfiability. Computer Science and Operations Research 1992: 23-42 - 1991
- [j33]Sylvia C. Boyd, William R. Pulleyblank:
Optimizing over the subtour polytope of the travelling salesman problem. Math. Program. 49: 163-187 (1991) - [j32]A. B. Gamble, Andrew R. Conn, William R. Pulleyblank:
A network penalty method. Math. Program. 50: 53-73 (1991) - 1990
- [j31]Clyde L. Monma, Beth Spellman Munson, William R. Pulleyblank:
Minimum-Weight Two-Connected Spanning Networks. Math. Program. 46: 153-171 (1990) - [e1]Ravi Kannan, William R. Pulleyblank:
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 [contents]
1980 – 1989
- 1989
- [j30]Egon Balas, William R. Pulleyblank:
The perfectly matchable subgraph polytope of an arbitrary graph. Comb. 9(4): 321-337 (1989) - [j29]Jean-Marie Bourjolly, William R. Pulleyblank:
König-Egerváry graphs, 2-bicritical graphs and fractional matchings. Discret. Appl. Math. 24(1-3): 63-82 (1989) - [j28]Noga Alon, Meir Katchalski, William R. Pulleyblank:
Cutting Disjoint Disks by Straight Lines. Discret. Comput. Geom. 4: 239-243 (1989) - [j27]Noga Alon, Meir Katchalski, William R. Pulleyblank:
The Maximum Size of a Convex Polygon in a Restricted Set in the Plane. Discret. Comput. Geom. 4: 245-251 (1989) - [j26]William R. Pulleyblank, Dominique de Werra:
Odd Path Packings. Eur. J. Comb. 10(6): 585-595 (1989) - [j25]Charles J. Colbourn, William R. Pulleyblank, Alexander Rosa:
Hybrid triple systems and cubic feedback sets. Graphs Comb. 5(1): 15-28 (1989) - [j24]Charles J. Colbourn, William R. Pulleyblank:
Matroid Steiner problems, the Tutte polynomial and network reliability. J. Comb. Theory B 47(1): 20-31 (1989) - [j23]A. B. Gamble, William R. Pulleyblank:
Forest covers and a polyhedral intersection theorem. Math. Program. 45(1-3): 49-58 (1989) - 1988
- [j22]William R. Pulleyblank:
Editorial. Math. Program. 42(1-3): 1 (1988) - 1987
- [j21]William R. Pulleyblank:
Fractional matchings and the Edmonds-Gallai theorem. Discret. Appl. Math. 16(1): 51-58 (1987) - [j20]Francisco Barahona, William R. Pulleyblank:
Exact arborescences, matchings and cycles. Discret. Appl. Math. 16(2): 91-99 (1987) - [j19]W. Cook, William R. Pulleyblank:
Linear Systems for Constrained Matching Problems. Math. Oper. Res. 12(1): 97-120 (1987) - [j18]Martin Grötschel, William R. Pulleyblank:
Corrigenda: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem. Math. Oper. Res. 12(1): 182-184 (1987) - 1986
- [j17]Martin Grötschel, William R. Pulleyblank:
Clique Tree Inequalities and the Symmetric Travelling Salesman Problem. Math. Oper. Res. 11(4): 537-569 (1986) - 1985
- [j16]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) - [j15]Michael Jünger, Gerhard Reinelt, William R. Pulleyblank:
On partitioning the edges of graphs into connected subgraphs. J. Graph Theory 9(4): 539-549 (1985) - [j14]Kevin White, Martin Farber, William R. Pulleyblank:
Steiner trees, connected domination and strongly chordal graphs. Networks 15(1): 109-124 (1985) - 1984
- [j13]Denis Naddef, William R. Pulleyblank:
Hamiltonicity in (0-1)-polyhedra. J. Comb. Theory B 37(1): 41-52 (1984) - 1983
- [j12]Gérard Cornuéjols, William R. Pulleyblank:
Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem. Comb. 3(1): 35-52 (1983) - [j11]Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank:
Halin graphs and the travelling salesman problem. Math. Program. 26(3): 287-294 (1983) - [j10]Egon Balas, William R. Pulleyblank:
The perfectly matchable subgraph polytope of a bipartite graph. Networks 13(4): 495-516 (1983) - 1982
- [j9]Jack Edmonds, László Lovász, William R. Pulleyblank:
Brick decompositions and the matching rank of graphs. Comb. 2(3): 247-274 (1982) - [j8]Gérard Cornuéjols, David Hartvigsen, William R. Pulleyblank:
Packing subgraphs in a graph. Oper. Res. Lett. 1(4): 139-143 (1982) - [c2]William R. Pulleyblank:
Polyhedral Combinatorics. ISMP 1982: 312-345 - 1981
- [j7]Denis Naddef, William R. Pulleyblank:
Matchings in regular graphs. Discret. Math. 34(3): 283-291 (1981) - [j6]Denis Naddef, William R. Pulleyblank:
Hamiltonicity and combinatorial polyhedra. J. Comb. Theory B 31(3): 297-312 (1981) - [j5]Martin Grötschel, William R. Pulleyblank:
Weakly bipartite graphs and the Max-cut problem. Oper. Res. Lett. 1(1): 23-27 (1981) - [j4]William R. Pulleyblank:
Total dual integrality and b-matchings. Oper. Res. Lett. 1(1): 28-30 (1981) - 1980
- [j3]Gérard Cornuéjols, William R. Pulleyblank:
A matching problem with side conditions. Discret. Math. 29(2): 135-159 (1980)
1970 – 1979
- 1979
- [j2]William R. Pulleyblank:
A note on graphs spanned by Eulerian graphs. J. Graph Theory 3(3): 309-310 (1979) - [j1]William R. Pulleyblank:
Minimum node covers and 2-bicritical graphs. Math. Program. 17(1): 91-103 (1979) - 1973
- [c1]William R. Pulleyblank:
Min-max relations and combinatorial algorithms. AFIPS National Computer Conference 1973: 453
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
