Blossom algorithm: Difference between revisions

Revision as of 00:58, 13 January 2019

Revision as of 12:10, 8 February 2019

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">{{citeCite book|firsturl=Alexander|last=Schrijver|authorlink=Alexander Schrijverhttps://www.springer.com/us/book/9783540443896|title=Combinatorial Optimization: Polyhedra and Efficiency|last=Schrijver|first=Alexander|date=2003|publisher=Springer-Verlag|isbn=9783540443896|series=Algorithms and Combinatorics|volume___location=Berlin Heidelberg|language=24en}}</ref>

==Augmenting paths==