William R. Pulleyblank - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 57 from 57

2019

Condorcet Optimal Clustering with Delaunay Triangulation: Climate Zones and World Happiness InsightsMax Bassett, Blake Newton, Joseph Schlessinger, Jacob Schmidt, Scott Lynch, Patrick Kuiper, Ryan Miller, Steven Morse, James Pleuss, Travis Russell, William R. Pulleyblank. sbp-brims 2019: 81-91 [doi]

2010

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

2008

Facet Generating TechniquesSylvia C. Boyd, William R. Pulleyblank. bonnco 2009: 33-55 [doi]

2003

Integer programmingGérard Cornuéjols, William R. Pulleyblank. mp, 98(1-3):1-2, 2003. [doi]

Mathematical sciences in the ninetiesWilliam R. Pulleyblank. ibmrd, 47(1):89-96, 2003. [doi]

Terascale Computing and BlueGeneWilliam R. Pulleyblank. iccd 2003: [doi]

2002

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

2001

PrefaceHenrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven Noble, William R. Pulleyblank. anor, 107(1-4):13, 2001. [doi]

1998

Preface: Mathematics of Industrial Systems IIIRainer E. Burkard, Toshihide Ibaraki, William R. Pulleyblank. anor, 76, 1998. [doi]

ForewordGérard Cornuéjols, William R. Pulleyblank. DAM, 89(1-3):1-2, 1998. [doi]

Traveling the Boundary of Minkowski SumsSándor P. Fekete, William R. Pulleyblank. ipl, 66(4):171-174, 1998. [doi]

1996

The Airline Crew Pairing Optimization ProblemWilliam R. Pulleyblank. istcs 1996: 189

1995

1994

1993

Area Optimization of Simple PolygonsSándor P. Fekete, William R. Pulleyblank. compgeom 1993: 173-182 [doi]

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

1992

Boolean-Combinatorial Bounding of Maximum 2-SatisfiabilityJean-Marie Bourjolly, Peter L. Hammer, William R. Pulleyblank, Bruno Simeone. In Osman Balci, Ramesh Sharda, Stavros A. Zenios, editors, Computer Science and Operations Research. pages 23-42, Pergamon Press, 1992. [doi]

1991

Optimizing over the subtour polytope of the travelling salesman problemS. C. Boyd, William R. Pulleyblank. mp, 49:163-187, 1991.

A network penalty methodA. B. Gamble, Andrew R. Conn, William R. Pulleyblank. mp, 50:53-73, 1991.

1990

Minimum-Weight Two-Connected Spanning NetworksClyde L. Monma, Beth Spellman Munson, William R. Pulleyblank. mp, 46:153-171, 1990.

1989

Cutting Disjoint Disks by Straight LinesNoga Alon, Meir Katchalski, William R. Pulleyblank. dcg, 4:239-243, 1989.

The Maximum Size of a Convex Polygon in a Restricted Set in the PlaneNoga Alon, Meir Katchalski, William R. Pulleyblank. dcg, 4:245-251, 1989.

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

König-Egerváry graphs, 2-bicritical graphs and fractional matchingsJean-Marie Bourjolly, William R. Pulleyblank. DAM, 24(1-3):63-82, 1989. [doi]

Hybrid triple systems and cubic feedback setsCharles J. Colbourn, William R. Pulleyblank, Alexander Rosa. gc, 5(1):15-28, 1989. [doi]

Matroid Steiner problems, the Tutte polynomial and network reliabilityCharles J. Colbourn, William R. Pulleyblank. JCT, 47(1):20-31, 1989. [doi]

Forest covers and a polyhedral intersection theoremA. B. Gamble, William R. Pulleyblank. mp, 45(1-3):49-58, 1989. [doi]

Odd Path PackingsWilliam R. Pulleyblank, Dominique de Werra. ejc, 10(6):585-595, 1989. [doi]

1988

EditorialWilliam R. Pulleyblank. mp, 42(1-3):1, 1988. [doi]

1987

Exact arborescences, matchings and cyclesFrancisco Barahona, William R. Pulleyblank. DAM, 16(2):91-99, 1987. [doi]

Linear Systems for Constrained Matching ProblemsW. Cook, William R. Pulleyblank. mor, 12(1):97-120, 1987. [doi]

Corrigenda: Clique Tree Inequalities and the Symmetric Travelling Salesman ProblemMartin Grötschel, William R. Pulleyblank. mor, 12(1):182-184, 1987. [doi]

Fractional matchings and the Edmonds-Gallai theoremWilliam R. Pulleyblank. DAM, 16(1):51-58, 1987. [doi]

1986

Clique Tree Inequalities and the Symmetric Travelling Salesman ProblemMartin Grötschel, William R. Pulleyblank. mor, 11(4):537-569, 1986. [doi]

1985

The Traveling Salesman Problem in Graphs with 3-Edge CutsetsGérard Cornuéjols, Denis Naddef, William R. Pulleyblank. JACM, 32(2):383-410, April 1985. [doi]

On partitioning the edges of graphs into connected subgraphsMichael Jünger, Gerhard Reinelt, William R. Pulleyblank. jgt, 9(4):539-549, 1985. [doi]

Steiner trees, connected domination and strongly chordal graphsKevin White, Martin Farber, William R. Pulleyblank. networks, 15(1):109-124, 1985. [doi]

1984

Hamiltonicity in (0-1)-polyhedraDenis Naddef, William R. Pulleyblank. JCT, 37(1):41-52, 1984. [doi]

1983

The perfectly matchable subgraph polytope of a bipartite graphEgon Balas, William R. Pulleyblank. networks, 13(4):495-516, 1983. [doi]

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

Halin graphs and the travelling salesman problemGérard Cornuéjols, Denis Naddef, William R. Pulleyblank. mp, 26(3):287-294, 1983. [doi]

1982

Packing subgraphs in a graphGérard Cornuéjols, David Hartvigsen, William R. Pulleyblank. orl, 1(4):139-143, 1982. [doi]

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

Polyhedral CombinatoricsWilliam R. Pulleyblank. ismp 1983: 312-345 [doi]

1981

Weakly bipartite graphs and the Max-cut problemMartin Grötschel, William R. Pulleyblank. orl, 1(1):23-27, 1981. [doi]

Hamiltonicity and combinatorial polyhedraDenis Naddef, William R. Pulleyblank. JCT, 31(3):297-312, 1981. [doi]

Matchings in regular graphsDenis Naddef, William R. Pulleyblank. DM, 34(3):283-291, 1981. [doi]

Total dual integrality and b-matchingsWilliam R. Pulleyblank. orl, 1(1):28-30, 1981. [doi]

1980

A matching problem with side conditionsGérard Cornuéjols, William R. Pulleyblank. DM, 29(2):135-159, 1980. [doi]

1979

A note on graphs spanned by Eulerian graphsWilliam R. Pulleyblank. jgt, 3(3):309-310, 1979. [doi]

Minimum node covers and 2-bicritical graphsWilliam R. Pulleyblank. mp, 17(1):91-103, 1979. [doi]

1973

Min-max relations and combinatorial algorithmsWilliam R. Pulleyblank. afips 1974: 453 [doi]

Sign in or sign up to see more results.

runs on WebDSL