Combinatorial Optimization — Eureka, You Shrink!

Volume 2570 of the series Lecture Notes in Computer Science pp 27-30


Matching: A Well-Solved Class of Integer Linear Programs

  • Jack EdmondsAffiliated withNational Bureau of Standards
  • , Ellis L. JohnsonAffiliated withI.B.M. Research Center

* Final gross prices may vary according to local VAT.

Get Access


A main purpose of this work is to give a good algorithm for a certain well-described class of integer linear programming problems, called matching problems (or the matching problem). Methods developed for simple matching [2]