Quadratic pseudo-Boolean optimization: Difference between revisions

Revision as of 15:03, 16 January 2019

Revision as of 15:05, 16 January 2019

Line 51:

== References ==

<references />

<ref name="review">Kolmogorov and Rother (2007).</ref>

<ref name="fix">Fix et al. (2011).</ref>

Line 57:

<ref name="billionnet">Billionnet and Jaumard (1989).</ref>

<ref name="rother">Rother et al. (2007).</ref>

<references /references>

* {{cite journal|first1=Alain|last1=Billionnet|first2=Brigitte|last2=Jaumard|title=A decomposition method for minimizing quadratic pseudo-boolean functions|journal=Operations Research Letters|volume=8|number=3|publisher=Elsevier|pages=161–163|year=1989}}

* {{cite conference|first1=Alexander|last1=Fix|first2=Aritanan|last2=Gruber|first3=Endre|last3=Boros|first4=Ramin|last4=Zabih|title=A graph cut algorithm for higher-order Markov random fields|conference=IEEE International Conference on Computer Vision|year=2011|pages=1020–1027}}

Line 83:

#: where <math>a = \min \{ w_p^0, w_p^1 \}</math>.

</ref>

<references /references>

== External links ==