On quadratization of pseudo-boolean functions

International Symposium on Artificial Intelligence and Mathematics, ISAIM 2012

Volumn , Issue , 2012, Pages

  Boros, Endre ^a   Gruber, Aritanan ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84885771229     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Billionnet, A., and Minoux, M. 1985. Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions. Discrete Applied Mathematics 12(1):1-11.
2. Boros, E., and Hammer, P. L. 1989. A max-flow approach to improved roof-duality in quadratic 0 - 1 minimization. Technical Report RRR 15-1989, RUTCOR, Rutgers University.
3. Boros, E., and Hammer, P. L. 2002. Pseudo-boolean optimization. Discrete Applied Mathematics 123(1-3):155-225.
4. Boros, E.; Hammer, P. L.; Sun, R.; and Tavares, G. 2008. A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (qubo). Discrete Optimization 5(2):501-529.
5. Buchheim, C., and Rinaldi, G. 2007. Efficient reduction of polynomial zero-one optimization to the quadratic case. SIAM Journal on Optimization 18(4):1398-1413.
6. Fix, A.; Gruber, A.; Boros, E.; and Zabih, R. 2011. A graph cut algorithm for higher-order markov random fields. In ICCV.
7. Freedman, D., and Drineas, P. 2005. Energy minimization via graph cuts: Settling what is possible. In CVPR (2), 939-946. IEEE Computer Society.
8. Gallo, G., and Simeone, B. 1989. On the supermodular knapsack problem. Mathematical Programming 45:295-309.
9. Grötschel, M.; Lovász, L.; and Schrijver, A. 1981. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2):169-197.
10. Hammer, P., and Rudeanu, S. 1968. Boolean Methods in Operations Research and Related Areas. Springer Verlag.
11. Hammer, P.; Hansen, P.; and Simeone, B. 1984. Roof duality, complementation and persistency in quadratic 0 - 1 optimization. Mathematical Programming 28:121-155.
12. Hammer, P. L. 1965. Some network flow problems solved with pseudo-boolean programming. Operations Research 13(3):388-399.
13. Hansen, P. 1979. Methods of nonlinear 0-1 programming. Annals of Discrete Mathematics 5:53-70.
14. Ishikawa, H. 2009. Higher-order gradient descent by fusionmove graph cut. In ICCV, 568-574. IEEE.
15. Ishikawa, H. 2011. Transformation of general binary mrf minimization to the first-order case. IEEE Trans. Pattern Anal. Mach. Intell. 33(6):1234-1249.
16. Iwata, S.; Fleischer, L.; and Fujishige, S. 2000. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. In STOC, 97-106.
17. Kolmogorov, V., and Zabih, R. 2004. What energy functions can be minimized via graph cuts? IEEE Trans. Pattern Anal. Mach. Intell. 26(2):147-159.
18. Ramalingam, S.; Russell, C.; Ladicky, L.; and Torr, P. H. S. 2011. Efficient minimization of higher order submodular functions using monotonic boolean functions. CoRR abs/1109.2304.
19. Rosenberg, I. 1975. Reduction of bivalent maximization to the quadratic case. Technical report, Centre d'Etudes de Recherche Operationnelle.
20. Roth, S., and Black, M. J. 2009. Fields of experts. International Journal of Computer Vision 82(2):205-229.
21. Rother, C.; Kolmogorov, V.; Lempitsky, V. S.; and Szummer, M. 2007. Optimizing binary mrfs via extended roof duality. In CVPR. IEEE Computer Society.
22. Rother, C.; Kohli, P.; Feng,W.; and Jia, J. 2009. Minimizing sparse higher order energy functions of discrete variables. In CVPR, 1382-1389. IEEE.
23. Schrijver, A. 2000. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory, Ser. B 80(2):346-355.
24. Zivny, S., and Jeavons, P. G. 2010. Classes of submodular constraints expressible by graph cuts. Constraints 15(3):430-452.
25. Zivny, S.; Cohen, D. A.; and Jeavons, P. G. 2009a. The expressive power of binary submodular functions. Discrete Applied Mathematics 157(15):3347-3358.
26. Zivny, S.; Cohen, D. A.; and Jeavons, P. G. 2009b. The expressive power of binary submodular functions. Discrete Applied Mathematics 157(15):3347-3358.
27. Zivny, S.; Cohen, D. A.; and Jeavons, P. G. 2009b. The expressive power of binary submodular functions. In Královic, R., and Niwinski, D., eds., MFCS, volume 5734 of Lecture Notes in Computer Science, 744-757. Springer.