William H. Cunningham

From MaRDI portal
Person:949789

Available identifiers

zbMath Open cunningham.william-hMaRDI QIDQ949789

List of research outcomes





PublicationDate of PublicationType
Separation problems for the stable set polytope2022-08-30Paper
On dual integrality in matching problems2019-07-22Paper
The coming of the matroids2013-04-17Paper
An algorithm for packing non-zero \(A\)-paths in group-labelled graphs2008-10-21Paper
On Integer Programming and the Branch-Width of the Constraint Matrix2007-11-29Paper
Optimal 3-terminal cuts and linear programming2006-05-02Paper
On the even permutation polytope2004-11-22Paper
Matching, matroids, and extensions2002-12-01Paper
Integral solutions of linear complementarity problems2001-11-26Paper
Restricted 2-factor polytopes2001-11-06Paper
Principally unimodular skew-symmetric matrices1999-10-31Paper
https://portal.mardi4nfdi.de/entity/Q42637061999-09-22Paper
The optimal path-matching problem1998-11-23Paper
https://portal.mardi4nfdi.de/entity/Q43712901998-01-12Paper
Wheel inequalities for stable set polytopes1997-11-25Paper
https://portal.mardi4nfdi.de/entity/Q56872651996-12-11Paper
https://portal.mardi4nfdi.de/entity/Q48717591996-04-08Paper
Ladders for Travelling Salesmen1996-04-01Paper
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra1995-09-11Paper
A separation algorithm for the matchable set polytope1994-09-26Paper
A faster algorithm for computing the strength of a network1994-04-05Paper
https://portal.mardi4nfdi.de/entity/Q40353601993-05-18Paper
\(b\)-matching degree-sequence polyhedra1992-06-27Paper
Computing the binding number of a graph1992-06-25Paper
Small Travelling Salesman Polytopes1992-06-25Paper
Short cocircuits in binary matroids1987-01-01Paper
Improved Bounds for Matroid Partition and Intersection Algorithms1986-01-01Paper
Dominants and submissives of matching polyhedra1986-01-01Paper
Compositions for perfect graphs1985-01-01Paper
A Primal-Dual Algorithm for Submodular Flows1985-01-01Paper
On submodular function minimization1985-01-01Paper
Optimal attack and reinforcement of a network1985-01-01Paper
The Partial Order of a Polymatroid Extreme Point1985-01-01Paper
Minimum cuts, modular functions, and matroid polyhedra1985-01-01Paper
A submodular network simplex method1984-01-01Paper
Testing membership in matroid polyhedra1984-01-01Paper
Decomposition of submodular functions1983-01-01Paper
Reductions to 1–matching polyhedra1983-01-01Paper
On cycling in the network simplex method1983-01-01Paper
Technical Note—A Class of Linear Programs Convertible to Network Problems1983-01-01Paper
Decomposition of Directed Graphs1982-01-01Paper
Polyhedra for Composed Independence Systems1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39582391982-01-01Paper
Separating cocircuits in binary matroids1982-01-01Paper
On matroid connectivity1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39328161981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39551801981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39294141981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39328151981-01-01Paper
A Combinatorial Decomposition Theory1980-01-01Paper
Converting Linear Programs to Network Problems1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39090661979-01-01Paper
Theoretical Properties of the Network Simplex Method1979-01-01Paper
BINARY MATROID SUMS1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41976441978-01-01Paper
Chords and disjoint paths in matroids1977-01-01Paper
An unbounded matroid intersection polyhedron1977-01-01Paper
A network simplex method1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40919981974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41654001973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40560421971-01-01Paper

Research outcomes over time

This page was built for person: William H. Cunningham