William H. Cunningham

Generating author description...

All published works

Action	Title	Year	Authors
+	On the even permutation polytope	2004	William H. Cunningham Yaoguang Wang
+	Principally Unimodular Skew-Symmetric Matrices	1998	A. Bouchet William H. Cunningham Jim Geelen
+	Integral Solutions of Linear Complementarity Problems	1998	William H. Cunningham James F. Geelen
+	Computing the binding number of a graph	1990	William H. Cunningham
+	On dual integrality in matching problems	1989	Francisco Barahona William H. Cunningham
+	Short Cocircuits in Binary Matroids	1987	Robert E. Bixby William H. Cunningham
+	Optimal attack and reinforcement of a network	1985	William H. Cunningham
+	Reductions to 1–matching polyhedra	1983	Julián Aráoz William H. Cunningham Jack Edmonds Jan Green‐Krótki
+	Polyhedra for Composed Independence Systems	1982	William H. Cunningham
+ PDF Chat	A Combinatorial Decomposition Theory	1980	William H. Cunningham Jack Edmonds
+	Theoretical Properties of the Network Simplex Method	1979	William H. Cunningham
+	A primal algorithm for optimum matching	1978	William H. Cunningham A. B. Marsh

Common Coauthors

Coauthor	Papers Together
Jack Edmonds	2
Julián Aráoz	1
Robert E. Bixby	1
A. B. Marsh	1
Jim Geelen	1
Jan Green‐Krótki	1
Francisco Barahona	1
James F. Geelen	1
Yaoguang Wang	1
A. Bouchet	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Maximum matching and a polyhedron with 0,1-vertices	1965	Jack Edmonds	4
+ PDF Chat	A homotopy theorem for matroids. I	1958	W. T. Tutte	2
+	A Generalization of Tutte's Characterization of Totally Unimodular Matrices	1997	Jim Geelen	2
+	Matching, a well solved class of integer linear programs	1970	Jennifer Edmonds	2
+ PDF Chat	A Combinatorial Decomposition Theory	1980	William H. Cunningham Jack Edmonds	2
+	Tough graphs and hamiltonian circuits	1973	Vašek Chvátal	2
+	Unimodularity and circle graphs	1987	André Bouchet	2
+	The alternating basis algorithm for assignment problems	1977	R. S. Barr Fred Glover Darwin Klingman	2
+	Some facets of the polytope of even permutation matrices	2004	Jeffrey B. Hood David Perkinson	1
+	Recognizing tough graphs is NP-hard	1990	Douglas C. Bauer S. L. Hakimi E. F. Schmeichel	1
+	Fractional Programming. II, On Dinkelbach's Algorithm	1976	Siegfried Schaible	1
+	The Linear Complementarity Problem	2009	Richard W. Cottle Jong‐Shi Pang Richard Stone	1
+	The polytope of even doubly stochastic matrices	1991	Richard A. Brualdi Bo Liu	1
+	A characterization of unimodular orientations of simple graphs	1992	André Bouchet	1
+	A short proof of Tutte's characterization of totally unimodular matrices	1989	A.M.H. Gerards	1
+	Minimum partition of a matroid into independent subsets	1965	Jack Edmonds	1
+	Perfect matchings of a graph	1971	Ian Anderson	1
+	Principally Unimodular Skew-Symmetric Matrices	1998	A. Bouchet William H. Cunningham Jim Geelen	1
+	On Odd Cuts and Plane Multicommodity Flows	1981	Paul Seymour	1
+	Integer Solution for Linear Complementarity Problem	1998	R. Chandrasekaran S.N. Kabadi R. Sridhar	1
+	Edge-Disjoint Spanning Trees of Finite Graphs	1961	C. St. J. A. Nash‐Williams	1
+	On a theorem of L. Mirsky on even doubly-stochastic matrices	1985	Joachim von Below	1
+	Reductions to 1–matching polyhedra	1983	Julián Aráoz William H. Cunningham Jack Edmonds Jan Green‐Krótki	1
+	Matrices with forbidden subconfigurations	1985	R.P. Anstee U. S. R. Murty	1
+	On polynomials and crossing numbers of complete graphs	1971	Thomas L. Saaty	1
+	On certain polytopes associated with graphs	1975	Vašek Chvátal	1
+	On the Problem of Decomposing a Graph into <i>n</i> Connected Factors	1961	W. T. Tutte	1
+ PDF Chat	Permanents, Pfaffian Orientations, and Even Directed Circuits	1999	Neil Robertson Paul Seymour Robin Thomas	1
+	Optimal attack and reinforcement of a network	1985	William H. Cunningham	1
+	New Finite Pivoting Rules for the Simplex Method	1977	Robert G. Bland	1
+	Transversals and matroid partition	1965	Jack Edmonds D.R. Fulkerso	1
+	A bad network problem for the simplex method and other minimum cost flow algorithms	1973	Norman Zadeh	1
+ PDF Chat	Short proofs on the matching polyhedron	1983	Alexander Schrijver	1
+	A strongly polynomial minimum cost circulation algorithm	1985	Éva Tardos	1
+	Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector	1980	Satoru Fujishige	1
+	Submodular functions, matroids, and certain polyhedra	1970	Jack Edmonds	1
+	Lectures on matroids	1965	W. T. Tutte	1
+	Linear Inequalities and Related Systems.	1956	George B. Dantzig Harold W. Kuhn A. W. Tucker	1
+	The Linear Complementarity Problem.	1993	M. E. B. Brigden Richard W. Cottle Jong‐Shi Pang Richard Stone	1
+	A combinatorial equivalence of matrices	1960	A. W. Tucker	1
+ PDF Chat	Theory of Linear and Integer Programming.	1987	David K. Smith Alexander Schrijver	1
+	A primal algorithm for optimum matching	1978	William H. Cunningham A. B. Marsh	1
+	Integral Boundary Points of Convex Polyhedra	2009	Alan J. Hoffman Joseph B. Kruskal	1
+	A proof of total dual integrality of matching polyhedra	1977	Paul Seymour Alexander Schrijver	1
+	Connectivity in Graphs	1966	W. T. Tutte	1
+	HOW GOOD IS THE SIMPLEX ALGORITHM	1970	Victor Klee George J. Minty	1
+	Mathematical centre amsterdam	1953	Smc Smc Afdeling Zuivere Wiskunde	1
+ PDF Chat	Pólya's Permanent Problem	2004	William McCuaig	1
+	On Nonlinear Fractional Programming	1967	Werner Dinkelbach	1
+	On the density of families of sets	1972	N. Sauer	1