Blossom algorithm: Difference between revisions

Revision as of 15:53, 3 January 2014

Revision as of 05:06, 17 January 2014

Line 28:

| pages = 125–130

}}</ref>

As elaborated by [[Alexander Schrijver]], further significance of the result comes from the fact that this was the first polytope whose proof of integrality "does not simply follow just from [[total unimodularity]], and its description was a breakthrough in [[polyhedral combinatorics]]."<ref name="schrijver">{{cite book|first=Alexander|last=Schrijver|authorlink=Alexander Schrijver|title=Combinatorial Optimization: Polyhedra and Efficiency|publisher=Springer|series=Algorithms and Combinatorics|volume=24}}</ref>

==Augmenting paths==