Revision as of 12:02, 1 June 2021 edit Scope creep (talk \| contribs) Autopatrolled, Extended confirmed users, Page movers, New page reviewers, Pending changes reviewers 149,426 edits →Higher order terms: Remove Dattani. Definition of process is not inimical to the intellectual content of the article. It add nothing apart from the definition of the term, which generic. ← Previous edit		Revision as of 12:02, 1 June 2021 edit undo Scope creep (talk \| contribs) Autopatrolled, Extended confirmed users, Page movers, New page reviewers, Pending changes reviewers 149,426 edits →References: Remove paper Next edit →
Line 61: ==References== * {{cite journal\|first1=Alain\|last1=Billionnet\|first2=Brigitte\|last2=Jaumard\|author2-link= Brigitte Jaumard \|title=A decomposition method for minimizing quadratic pseudo-boolean functions\|journal= [[Operations Research Letters]] \|volume=8\|number=3\| pages=161–163\|year=1989\|doi=10.1016/0167-6377(89)90043-6}} * {{cite arXiv\|title=Quadratization in discrete optimization and quantum mechanics\|eprint=1901.04405\|first=Nike\|last=Dattani\|year=2019\|class=quant-ph}} * {{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= [[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= [[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}}

Quadratic pseudo-Boolean optimization: Difference between revisions