Jack R. Edmonds (born April 5, 1934) is an American-born and educated computer scientist and mathematician who lived and worked in Canada for much of his life. He has made fundamental contributions to the fields of combinatorial optimization, polyhedral combinatorics, discrete mathematics and the theory of computing. He was the recipient of the 1985 John von Neumann Theory Prize.

Edmonds attended Duke University before completing his undergraduate degree at George Washington University in 1957. He thereafter received a master's degree in 1960 at the University of Maryland under Bruce L. Reinhart with a thesis on the problem of embedding graphs into surfaces.^[1][2] From 1959 to 1969 he worked at the National Institute of Standards and Technology (then the National Bureau of Standards), and was a founding member of Alan Goldman’s newly created Operations Research Section in 1961. Goldman proved to be a crucial influence by enabling Edmonds to work in a RAND Corporation-sponsored workshop in Santa Monica, California. It is here that Edmonds first presented his findings on defining a class of algorithms that could run more efficiently. Most combinatorics scholars, during this time, were not focused on algorithms. However Edmonds was drawn to them and these initial investigations were key developments for his later work between matroids and optimization. He spent the years from 1961 to 1965 on the subject of NP versus P and in 1966 originated the conjectures NP ≠ P and NP ∩ coNP = P.

Edmonds's 1965 paper “Paths, Trees and Flowers” was a preeminent paper in initially suggesting the possibility of establishing a mathematical theory of efficient combinatorial algorithms. One of his earliest and notable contributions is the blossom algorithm for constructing maximum matchings on graphs, discovered in 1961^[3] and published in 1965.^[4] This was the first polynomial-time algorithm for maximum matching in graphs. Its generalization to weighted graphs^[5] was a conceptual breakthrough in the use of linear programming ideas in combinatorial optimization. It sealed in the importance of there being proofs, or "witnesses", that the answer for an instance is yes and there being proofs, or "witnesses", that the answer for an instance is no. In this blossom algorithm paper, Edmonds also characterizes feasible problems as those solvable in polynomial time; this is one of the origins of the Cobham–Edmonds thesis.^[6]

A breakthrough of the Cobham–Edmonds thesis, was defining the concept of polynomial time characterising the difference between a practical and an impractical algorithm (in modern terms, a tractable problem or intractable problem). Today, problems solvable in polynomial time are called the complexity class PTIME, or simply P.

Edmonds's paper “Maximum Matching and a Polyhedron with 0-1 Vertices” along with his previous work gave astonishing polynomial-time algorithms for the construction of maximum matchings. Most notably, these papers demonstrated how a good characterization of the polyhedron associated with a combinatorial optimization problem could lead, via the duality theory of linear programming, to the construction of an efficient algorithm for the solution of that problem.

Additional landmark work of Edmonds is in the area of matroids. He found a polyhedral description for all spanning trees of a graph, and more generally for all independent sets of a matroid.^[7] Building on this, as a novel application of linear programming to discrete mathematics, he proved the matroid intersection theorem, a very general combinatorial min-max theorem^[8][9] which, in modern terms, showed that the matroid intersection problem lay in both NP and co-NP.

Edmonds is well known for his theorems on max-weight branching algorithms^[10] and packing edge-disjoint branchings^[11] and his work with Richard Karp on faster flow algorithms. The Edmonds–Gallai decomposition theorem describes finite graphs from the point of view of matchings. He introduced polymatroids,^[8] submodular flows with Richard Giles,^[12] and the terms clutter and blocker in the study of hypergraphs.^[3] A recurring theme in his work^[13] is to seek algorithms whose time complexity is polynomially bounded by their input size and bit-complexity.^[3]

From 1969 on, with the exception of 1991–1993, he held a faculty position at the Department of Combinatorics and Optimization at the University of Waterloo's Faculty of Mathematics where his research encompassed combinatorial optimization problems and associated polyhedra. He supervised the doctoral work of a dozen students in this time.

From 1991 to 1993, he was involved in a dispute ("the Edmonds affair") with the University of Waterloo,^[14][15] wherein the university claimed that a letter submitted constituted a letter of resignation, which Edmonds denied.^[16] The conflict was resolved in 1993, and he returned to the university.

Edmonds retired from the University of Waterloo in 1999.

Edmonds was the 1985 recipient of the John von Neumann Theory Prize.

In 2001 his paper, "Paths, Trees and Flowers" was honoured as an Outstanding Publication by the National Institute of Standards and Technology in their celebratory edition of A Century of Excellence in Measurements Standards and Technology

He was elected to the 2002 class of Fellows of the Institute for Operations Research and the Management Sciences.^[17]

In 2006 the Queen of Denmark presented Edmonds with an Honorary Doctorate from the University of Southern Denmark.

In 2014 he was honored as a Distinguished Scientist and inducted into the National Institute of Standards and Technology's Gallery.

The fifth Aussois Workshop on Combinatorial Optimization in 2001 was dedicated to him.^[9]

Jack's son Jeff Edmonds is a professor of computer science at York University, and his wife Kathie Cameron is a professor of mathematics at Laurier University.

• Edmonds matrix
• List of University of Waterloo people