Pseudo-Boolean function: Difference between revisions

Revision as of 23:46, 28 January 2023

Revision as of 09:26, 8 July 2023

Line 46:

==References==

* {{cite journal |author1last1=Boros, |first1=E. |author2last2=Hammer, |first2=P. L. |year=2002 |title=Pseudo-Boolean Optimization |journal= [[Discrete Applied Mathematics]] |year=2002|volume=123|issue=1–3 |pages=155–225 |doi=10.1016/S0166-218X(01)00341-9 |doi-access=free |volume=123 |issue=1–3 |pages=155–225 |url=http://orbi.ulg.ac.be/handle/2268/202427 |doi-access=free}}

* {{cite journal |author1last1=Crowston, |first1=R. |author2last2=Fellows, |first2=M. | author3last3= Gutin, |first3=G. |author4last4=Jones, |first4=M. | author5last5= Rosamond, |first5=F. |author6last6=Thomasse, |first6=S. | author7last7= Yeo, |first7=A. |year=2011 |title=Simultaneously Satisfying Linear Equations Over GF(2): MaxLin2 and Max-r-Lin2 Parameterized Above Average. |journal=Proc. Of FSTTCS 2011|year=2011 |arxiv=1104.1135 |bibcode=2011arXiv1104.1135C}}

* {{cite journal |last=Ishikawa | first=H. |year=2011 |title=Transformation of general binary MRF minimization to the first order case |journal= [[IEEE Transactions on Pattern Analysis and Machine Intelligence]] |year=2011|volume=33|number=6|pages=1234–1249| doi=10.1109/tpami.2010.91 |pmid=20421673 |citeseerx=10.1.1.675.2183| |s2cid=17314555 |volume=33 |number=6 |pages=1234–1249}}

* {{cite conference |author1last1=Kahl, |first1=F. |author2last2=Strandmark, |first2=P. |year=2011|title=Generalized Roof Duality for Pseudo-Boolean Optimization| |conference= [[International Conference on Computer Vision]] |year=2011|url=http://www.maths.lth.se/vision/publdb/reports/pdf/kahl-strandmark-iccv-11.pdf}}

* {{cite journal |last=O'Donnell |first=Ryan |year=2008 |title=Some topics in analysis of Boolean functions |journal={{ECCC|2008|08|055}}|year=2008 |url=http://www.eccc.uni-trier.de/eccc-reports/2008/TR08-055/}}

* {{cite conference |author1last1=Rother, |first1=C. |author2last2=Kolmogorov, |first2=V. |author3last3=Lempitsky, |first3=V. |author4last4=Szummer, |first4=M. |year=2007 |title=Optimizing Binary MRFs via Extended Roof Duality |conference= [[Conference on Computer Vision and Pattern Recognition]] |year=2007|url=http://research.microsoft.com/pubs/67978/cvpr07-QPBOpi.pdf}}

* Alexander Schrijver. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time. Journal of Combinatorial Theory, Series B, Volume 80, Issue 2, November 2000, Pages 346-355.

[[Category:Mathematical optimization]]