Edmonds, matching and the birth of polyhedral combinatorics
zbMath1276.05096MaRDI QIDQ1946018
Publication date: 17 April 2013
Published in: Documenta Mathematica (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/DMJDMV/vol-ismp/34_pulleyblank-william.html
integer programmingmatchingsmatching algorithmfactorspolyhedral combinatoricsweighted matching probleminteger programming problemnonbipartite matching
Analysis of algorithms (68W40) Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) History of mathematics in the 20th century (01A60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
This page was built for publication: Edmonds, matching and the birth of polyhedral combinatorics