The following pages link to William R. Pulleyblank (Q582214):
Displaying 50 items.
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- Total dual integrality and integer polyhedra (Q598999) (← links)
- The perfectly matchable subgraph polytope of an arbitrary graph (Q757431) (← links)
- Odd path packings (Q757435) (← links)
- Balanced optimization problems (Q760338) (← links)
- Minimizing setups in ordered sets of fixed width (Q762183) (← links)
- (Q790833) (redirect page) (← links)
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834) (← links)
- Hamiltonicity in (0-1)-polyhedra (Q796554) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- Brick decompositions and the matching rank of graphs (Q1055426) (← links)
- Random near-regular graphs and the node packing problem (Q1065829) (← links)
- Matroid Steiner problems, the Tutte polynomial and network reliability (Q1088995) (← links)
- Exact arborescences, matchings and cycles (Q1095157) (← links)
- Fractional matchings and the Edmonds-Gallai theorem (Q1098861) (← links)
- Forest covers and a polyhedral intersection theorem (Q1121807) (← links)
- Hybrid triple systems and cubic feedback sets (Q1122578) (← links)
- Column generation and the airline crew pairing problem (Q1126867) (← links)
- A matching problem with side conditions (Q1145707) (← links)
- Hamiltonicity and combinatorial polyhedra (Q1147161) (← links)
- Matchings in regular graphs (Q1155070) (← links)
- (Q1166428) (redirect page) (← links)
- Packing subgraphs in a graph (Q1166429) (← links)
- Total dual integrality and b-matchings (Q1167664) (← links)
- Weakly bipartite graphs and the max-cut problem (Q1169411) (← links)
- A network penalty method (Q1174423) (← links)
- On the capacitated vehicle routing problem (Q1411621) (← links)
- TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer (Q1821039) (← links)
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings (Q1825210) (← links)
- On the submodular matrix representation of a digraph. (Q1853498) (← links)
- The precedence-constrained asymmetric traveling salesman polytope (Q1890926) (← links)
- New primal and dual matching heuristics (Q1891231) (← links)
- Edmonds, matching and the birth of polyhedral combinatorics (Q1946018) (← links)
- Traveling the boundary of Minkowski sums. (Q2583555) (← links)
- Traces of the XII Aussois Workshop on combinatorial optimization (Q2638379) (← links)
- Cutting disjoint disks by straight lines (Q2640143) (← links)
- The maximum size of a convex polygon in a restricted set of points in the plane (Q2640144) (← links)
- Facet Generating Techniques (Q2971603) (← links)
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem (Q3030581) (← links)
- The perfectly matchable subgraph polytope of a bipartite graph (Q3039039) (← links)
- A note on graphs spanned by Eulerian graphs (Q3048875) (← links)
- Minimum node covers and 2-bicritical graphs (Q3050138) (← links)
- (Q3318811) (← links)
- (Q3340896) (← links)
- (Q3682240) (← links)
- Eulerian Orientations and Circulations (Q3697049) (← links)
- (Q3698661) (← links)
- Steiner trees, connected domination and strongly chordal graphs (Q3701460) (← links)
- Linear Systems for Constrained Matching Problems (Q3752421) (← links)
- The traveling salesman problem in graphs with 3-edge cutsets (Q3773723) (← links)
