Quadratic pseudo-Boolean optimization: Difference between revisions

Content deleted Content added
adding links to references using Google Scholar
Line 52:
== References ==
<references>
<ref name="Dattani">Dattani (2019) [https://arxiv.org/pdf/1901.04405 Quadratization in discrete optimization and quantum mechanics] (Book).</ref>
<ref name="review">Kolmogorov and Rother (2007).</ref>
<ref name="fix">Fix et al. (2011).</ref>
Line 59:
<ref name="rother">Rother et al. (2007).</ref>
</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|url=https://www.sciencedirect.com/science/article/pii/0167637789900436}}
* {{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|url=https://www.cs.cornell.edu/~afix/Papers/ICCV11.pdf}}
* {{cite conference|first1=Hiroshi|last1=Ishikawa|title=Higher-Order Clique Reduction Without Auxiliary Variables|conference=IEEE Conference on Computer Vision and Pattern Recognition|year=2014|publisher=IEEE|pages=1362–1269|url=https://www.cv-foundation.org/openaccess/content_cvpr_2014/papers/Ishikawa_Higher-Order_Clique_Reduction_2014_CVPR_paper.pdf}}
* {{cite journal|first1=Vladimir|last1=Kolmogorov|first2=Carsten|last2=Rother|title=Minimizing Nonsubmodular Functions: A Review|journal=IEEE Transactions on Pattern Analysis and Machine Intelligence|volume=29|number=7|year=2007|pages=1274–1279|publisher=IEEE}}
* {{cite conference|first1=Carsten|last1=Rother|first2=Vladimir|last2=Kolmogorov|first3=Victor|last3=Lempitsky|first4=Martin|last4=Szummer|title=Optimizing binary MRFs via extended roof duality|conference=IEEE Conference on Computer Vision and Pattern Recognition|pages=1–8|year=2007|url=https://www.microsoft.com/en-us/research/wp-content/uploads/2007/06/cvpr07-QPBOpi-TR.pdf}}
 
== Notes ==