The DOI matches its Crossref record; 159 of the 162 references it cites were found in a registry or an index.
Pseudo-Boolean optimization
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“The potentially large overhead in the number of variables lead to the development of several methods for degree reduction (e.g., References [160, 167, 168, 180, 188])”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [168]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
(1979) · Cited by 43,841
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Theory of games and economic behavior
Garcia, S. R., & Miller, S. J. (2019) · American Mathematical Society eBooks · doi:10.1090/mbk/121/32 · Cited by 16,777
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Shapley, L. (1988) · Cambridge University Press eBooks · doi:10.1017/cbo9780511528446.003 · Cited by 10,698
17. A Value for n-Person Games
Shapley, L. S. (1953) · Contributions to the Theory of Games (AM-28), Volume II · doi:10.1515/9781400881970-018 · Cited by 6,950
Glover, F. (1990) · INFORMS journal on computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,777
Glover, F. (1989) · INFORMS journal on computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,469
The Theory of Games and Economic Behavior
Harrison, R. W., von Neumann, J., & Morgenstern, O. (1945) · Journal of Farm Economics · doi:10.2307/1232672 · Cited by 5,318
Research works printed but not linked: 17
- T. Badics, Approximation of some Nonlinear Binary Optimization Problems, Ph.D. Thesis, RUTCOR, Rutgers University, 1996.
- Balas, 1967, Extension de l'algorithme additif a la programmation en nombres at a la programmation non lineare, C. R. Acad. Sci. Paris, 258, 5136
- Banzhaf III, 1965, Weighted voting does not work: a mathematical analysis, Rutgers Law Rev., 19, 317
- Benzaken, 1983, Adjoints of pure bidirected graphs, Congr. Numer., 39, 123
- Fortet, 1959, L'algebre de Boole en recherche operationelle, Cahiers Études Centre Rech. Oper., 1, 5
- Fortet, 1960, Applications de l'algebre de Boole en recherche operationelle, Rev. Francaise Rech. Oper., 4, 17
- Hammer, 1968, Plant location—a pseudo-Boolean approach, Israel J. Technol., 6, 330
- Hammer, 1977, Pseudo-Boolean functions and game theory. I. Core elements and Shapley value, Cahiers Centre Etudes Rech. Oper., 19, 159
- Hammer, 1963, Application of discrete linear programming to the minimization of Boolean functions, Rev. Math. Pures Appl., 8, 459
- P. Hansen, B. Simeone, A class of quadratic pseudoboolean functions whose maximization is reducible to a network flow problem, CORR 79-39, Department of Comb. Optim., University of Waterloo.
- Laughhunn, 1971, Computational experience with capital expenditure programming models under risk, J. Business Finance, 3, 43
- Rosenberg, 1972, 0–1 optimization and non-linear programming, Rev. Française Automatique, Informatique Rech. Opér. (Série Bleue), 2, 95
- Rosenberg, 1975, Reduction of bivalent maximization to the quadratic case, Cahiers Centre Etudes Rech. Oper., 17, 71
- Rosenberg, 1980, Linear decompositions of positive real function of binary arguments, Utilitas Math., 17, 17
- I. Shepanik, Use of pseudo-boolean preference functions in metagame analysis, Ph.D. Thesis, Department of System Design, 1973.
- B. Simeone, Quadratic 0–1 programming, Boolean functions and graphs, Ph.D. Thesis in Combinatorics and Optimization, Waterloo, 1979.
- Trubin, 1969, On a method of solution of integer linear programming problems of special kind, Soviet Math. Dokl., 10, 1544
Cited by
Sorted by citations
Items 101–200 of 825
Subset Algebra Lift Operators for 0-1 Integer Programming
Bienstock, D., & Zuckerberg, M. (2004) · SIAM Journal on Optimization · doi:10.1137/s1052623402420346 · Cited by 61
Contextually Guided Semantic Labeling and Search for 3D Point CloudsPreprint
Anand, A., Koppula, H. S., Joachims, T., & Saxena, A. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1111.5358 · Cited by 61
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
Kochenberger, G. A., Glover, F., Alidaee, B., & Rego, C. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3449-7 · Cited by 60
Unsupervised Image Matching and Object Discovery as Optimization
Vo, H. V., Bach, F., Cho, M., Han, K., LeCun, Y., Pérez, P., & Ponce, J. (2019) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2019.00848 · Cited by 60
A Principled Deep Random Field Model for Image Segmentation
Kohli, P., Osokin, A., & Jegelka, S. (2013) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2013.257 · Cited by 61
Multiagent Resource Allocation with K -additive Utility Functions
Chevaleyre, Y., Endriss, U., Estivie, S., Nicolas Maudet, B., & Paris-dauphine, U. (2004) · Cited by 59
Li, C., Song, D., & Tao, D. (2019) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3292500.3330983 · Cited by 61
Convexity Shape Prior for Binary Segmentation
Gorelick, L., Veksler, O., Boykov, Y. Y., & Nieuwenhuis, C. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2547399 · Cited by 58
Multiagent resource allocation in k-additive domains: preference representation and complexity
Chevaleyre, Y., Endriss, U., Estivie, S., & Nicolas Maudet, B. (2008) · Annals of Operations Research · doi:10.1007/s10479-008-0335-0 · Cited by 57
Semi-online Multi-people Tracking by Re-identification
Lan, L., Wang, X., Hua, G., Huang, T. S., & Tao, D. (2020) · International Journal of Computer Vision · doi:10.1007/s11263-020-01314-1 · Cited by 57
Efficient optimization with higher-order Ising machines
Bybee, C., Kleyko, D. V., Nikonov, D. E., Khosrowshahi, A., Olshausen, B. A., & Sommer, F. T. (2023) · Nature Communications · doi:10.1038/s41467-023-41214-9 · Cited by 70
Reduce, reuse & recycle: Efficiently solving multi-label MRFs
Alahari, K., Kohli, P., & Torr, P. H. S. (2008) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2008.4587402 · Cited by 56
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
Tamura, K., Shirai, T., Katsura, H., Tanaka, S., & Togawa, N. (2021) · IEEE Access · doi:10.1109/access.2021.3081685 · Cited by 57
A flexible tensor block coordinate ascent scheme for hypergraph matching
Ngoc, Q. N., Gautier, A., & Hein, M. (2015) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2015.7299164 · Cited by 55
Communication Lower Bounds Using Directional Derivatives
Sherstov, A. A. (2014) · Journal of the ACM · doi:10.1145/2629334 · Cited by 54
Olsson, C., Ulén, J., & Boykov, Y. Y. (2013) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2013.226 · Cited by 54
Programmable Quantum Annealing Architectures with Ising Quantum Wires
Qiu, X., Zoller, P., & Li, X. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020311 · Cited by 52
Exact and heuristic approaches to input vector control for leakage power reduction
Gao, F., & Hayes, J. P. (2005) · doi:10.1109/iccad.2004.1382634 · Cited by 54
Cooper, M., de Givry, S., & Schiex, T. (2007) · HAL · Cited by 54
A new modeling and solution approach for the set-partitioning problem
Lewis, M. W., Kochenberger, G. A., & Alidaee, B. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2006.04.002 · Cited by 53
A Polyhedral Study of Binary Polynomial Programs
Pia, A. D., & Khajavirad, A. (2016) · Mathematics of Operations Research · doi:10.1287/moor.2016.0804 · Cited by 53
Joint Multi-Leaf Segmentation, Alignment, and Tracking for Fluorescence Plant Videos
Yin, X. P., Liu, X., Chen, J., & Kramer, D. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2728065 · Cited by 53
A new approach for modeling and solving set packing problems
Alidaee, B., Kochenberger, G. A., Lewis, K. R., Lewis, M. W., & Wang, H. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.12.068 · Cited by 52
Linear intensity-based image registration by Markov random fields and discrete optimization
Zikic, D., Glocker, B., Kutter, O., Groher, M., Nikos Komodakis, A., Kamen, A., Nikos Paragios, A., & Navab, N. (2010) · Medical Image Analysis · doi:10.1016/j.media.2010.04.003 · Cited by 51
Next Generation Genetic Algorithms: A User’s Guide and Tutorial
Whitley, D. (2018) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-3-319-91086-4_8 · Cited by 51
ACO-based clustering for Ego Network analysis
González-Pardo, A., Jung, J. J., & Camacho, D. (2016) · Future Generation Computer Systems · doi:10.1016/j.future.2016.06.033 · Cited by 50
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
Boros, E., Hammer, P. L., Sun, R. L., & Tavares, G. (2007) · Discrete Optimization · doi:10.1016/j.disopt.2007.02.001 · Cited by 50
Self-citationPBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
Philipp, T., & Steinke, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24318-4_2 · Cited by 50
Fractional 0–1 programming: applications and algorithms
Borrero, J. S., Gillen, C. P., & Prokopyev, O. A. (2016) · Journal of Global Optimization · doi:10.1007/s10898-016-0487-4 · Cited by 50
Optimizing adiabatic quantum program compilation using a graph-theoretic framework
Goodrich, T. D., Sullivan, B. D., & Humble, T. S. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1863-4 · Cited by 50
Energy minimization for linear envelope MRFs
Kohli, P., & Kumar, M. (2010) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2010.5539858 · Cited by 49
Building an iterative heuristic solver for a quantum annealer
Rosenberg, G., Vazifeh, M. M., Woods, B., & Haber, E. (2016) · Computational Optimization and Applications · doi:10.1007/s10589-016-9844-y · Cited by 49
Discrete optimization of ray potentials for semantic 3D reconstruction
Savinov, N., Ladický, Ľ., Häne, C., & Pollefeys, M. (2015) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2015.7299190 · Cited by 48
An Algebraic Theory of Complexity for Discrete Optimization
Cohen, D. A., Cooper, M., Creed, P., Jeavons, P., & Živný, S. (2013) · SIAM Journal on Computing · doi:10.1137/130906398 · Cited by 48
Automatic detection and tracking of pedestrians from a moving stereo rig
Konrad Schindler, B., Ess, A., Leibe, B., & Gool, L. V. (2010) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2010.06.006 · Cited by 48
A class of valid inequalities for multilinear 0–1 optimization problems
Crama, Y., & Rodríguez-Heck, E. (2017) · Discrete Optimization · doi:10.1016/j.disopt.2017.02.001 · Cited by 48
Virtual arc consistency for weighted CSPPreprint
Cooper, M., de Givry, S., Sánchez-Fibla, M., Schiex, T., & Zytnicki, M. (2008) · Cited by 48
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach
Crowston, R., Fellows, M. R., Gutin, G., Jones, M., Kim, E. J., Rosamond, F., Ruzsa, I. Z., Thomassé, S., & Yeo, A. (2013) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2013.10.002 · Cited by 47
The Multilinear Polytope for Acyclic Hypergraphs
Pia, A. D., & Khajavirad, A. (2018) · SIAM Journal on Optimization · doi:10.1137/16m1095998 · Cited by 47
The expressive power of binary submodular functions
Živný, S., Cohen, D. A., & Jeavons, P. (2009) · Discrete Applied Mathematics · doi:10.1016/j.dam.2009.07.001 · Cited by 47
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
Buchheim, C., & Rinaldi, G. (2007) · SIAM Journal on Optimization · doi:10.1137/050646500 · Cited by 47
Iterated Greedy algorithm for performing community detection in social networks
Sánchez‐Oro, J., & Duarte, A. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2018.06.010 · Cited by 46
Babbush, R., Perdomo‐Ortiz, A., O'Gorman, B., Macready, W., & Aspuru‐Guzik, A. (2014) · Advances in Chemical Physics · doi:10.1002/9781118755815.ch05 · Cited by 45
Resource efficient gadgets for compiling adiabatic quantum optimization problems
Babbush, R., O'Gorman, B., & Aspuru‐Guzik, A. (2013) · Annalen der Physik · doi:10.1002/andp.201300120 · Cited by 46
Minimizing Energies with Hierarchical Costs
Delong, A., Gorelick, L., Veksler, O., & Boykov, Y. Y. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-012-0531-x · Cited by 44
Finding incremental solutions for evolving requirements
Ernst, N., Borgida, A. T., & Jureta, I. (2011) · IEEE International Requirements Engineering Conference (RE) · doi:10.1109/re.2011.6051656 · Cited by 44
A Fast Continuous Max-Flow Approach to Non-convex Multi-labeling Problems
Bae, E., Yuan, J. Y., Tai, X., & Boykov, Y. Y. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54774-4_7 · Cited by 43
Aghazadeh, A., Nisonoff, H. M., Öçal, O., Brookes, D. H., Huang, Y., Koyluoglu, O. O., Listgarten, J., & Ramchandran, K. (2021) · Nature Communications · doi:10.1038/s41467-021-25371-3 · Cited by 43
On complexity of unconstrained hyperbolic 0–1 programming problems
Prokopyev, O. A., Huang, H.-X., & Pardalos, P. M. (2004) · Operations Research Letters · doi:10.1016/j.orl.2004.05.011 · Cited by 42
Submodularization for Binary Pairwise Energies
Gorelick, L., Boykov, Y. Y., Veksler, O., Ayed, I. B., & Delong, A. (2014) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2014.151 · Cited by 40
Portfolio Optimization: Applications in Quantum Computing
Marzec, M. (2016) · Wiley eBooks · doi:10.1002/9781118593486.ch4 · Cited by 42
A family of heuristic search algorithms for feature model optimization
Sánchez, L. E., Diaz-Pace, J. A., & Zunino, A. (2018) · Science of Computer Programming · doi:10.1016/j.scico.2018.12.002 · Cited by 39
Pseudo-bound Optimization for Binary Energies
Tang, M., Ayed, I. B., & Boykov, Y. Y. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10602-1_45 · Cited by 39
Tabb, A. (2013) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2013.28 · Cited by 39
Learning object relationships via graph-based context model
Myeong, H., Chang, J. Y., & Lee, K. M. (2012) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2012.6247995 · Cited by 39
Solving Large Maximum Clique Problems on a Quantum Annealer
Pelofske, E., Hahn, G., & Djidjev, H. (2019) · QTOP@NetSys · doi:10.1007/978-3-030-14082-3_11 · Cited by 51
Fast Joint Compression and Summarization via Graph Cuts
Qian, X., & Liu, Y. (2013) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d13-1156 · Cited by 38
Simple negotiation schemes for agents with simple preferences: sufficiency, necessity and maximality
Chevaleyre, Y., Endriss, U., & Nicolas Maudet, B. (2009) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-009-9088-7 · Cited by 38
Advanced Structured Prediction
Nowozin, S. (2014) · The MIT Press eBooks · doi:10.7551/mitpress/9969.001.0001 · Cited by 43
Higher-order segmentation via multicuts
Kappes, J. H., Speth, M., Reinelt, G., & Schnörr, C. (2015) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2015.11.005 · Cited by 37
On the Convergence of Chemical Reaction Optimization for Combinatorial Optimization
Lam, A. Y. S., Li, V. O. K., & Xu, J. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2227973 · Cited by 37
Huang, W., Kitchaev, D. A., Dacek, S. T., Rong, Z., Urban, A., Cao, S., Luo, C. W., & Ceder, G. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.94.134424 · Cited by 37
Community Search over Big Graphs
Huang, X. S., Lakshmanan, L. V. S., & Xu, J. (2019) · Synthesis lectures on data management · doi:10.1007/978-3-031-01874-9 · Cited by 39
Combinatorial structure and randomized subexponential algorithms for infinite games
Björklund, H., & Vorobyov, S. G. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.07.041 · Cited by 37
Nikos Komodakis, A., & Pesquet, J.-C. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.5429 · Cited by 37
An Adaptable Rule Placement for Software-Defined Networks
Zhang, S., Ivančić, F., Lumezanu, C., Yuan, Y., Gupta, A., & Malik, S. (2014) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2014.24 · Cited by 36
Dynamic Hybrid Algorithms for MAP Inference in Discrete MRFs
Alahari, K., Kohli, P., & Torr, P. H. S. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.194 · Cited by 36
Exact and Heuristic Approaches to Input Vector Control for Leakage Power Reduction
Gao, F., & Hayes, J. P. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2006.875711 · Cited by 36
Solving Energies with Higher Order Cliques
Kohli, P., Kumar, M., & Torr, P. H. S. (2007) · Cited by 36
Quadratization in discrete optimization and quantum mechanicsPreprint
Dattani, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.04405 · Cited by 56
Polyhedral outer approximations with application to natural language parsing
Martins, A. F. T., Smith, N. A., & Xing, E. P. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553466 · Cited by 38
Li, H., Wang, Y., & Liu, Z. (2013) · Asian Journal of Control · doi:10.1002/asjc.767 · Cited by 35
Compact quadratizations for pseudo-Boolean functions
Boros, E., Crama, Y., & Rodríguez-Heck, E. (2019) · Journal of Combinatorial Optimization · doi:10.1007/s10878-019-00511-0 · Cited by 35
Self-citationCategorical Tensor Network States
Biamonte, J., Clark, S. R., & Jaksch, D. (2011) · AIP Advances · doi:10.1063/1.3672009 · Cited by 37
Improved compact linearizations for the unconstrained quadratic 0–1 minimization problem
Hansen, P., & Meyer, C. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.12.008 · Cited by 35
From Photohulls to Photoflux Optimization
Boykov, Y. Y., & Lempitsky, V. (2006) · British Machine Vision Conference (BMVC) · doi:10.5244/c.20.117 · Cited by 35
Quantum Algorithms for Scientific Computing and Approximate OptimizationPreprint
Hadfield, S. (2018) · arXiv (Cornell University) · doi:10.7916/d8x650c9 · Cited by 76
Nonparametric Information Geometry
Pistone, G. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40020-9_3 · Cited by 34
New algorithms for convex cost tension problem with application to computer vision
Kolmogorov, V., & Shioura, A. (2009) · Discrete Optimization · doi:10.1016/j.disopt.2009.04.006 · Cited by 34
A linearization framework for unconstrained quadratic (0-1) problems
Guèye, S., & Michelon, P. Y. P. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2008.01.028 · Cited by 34
Convex relaxation methods for graphical models: lagrangian and maximum entropy approaches
Willsky, A. S., & Johnson, J. K. (2008) · Cited by 35
MAP Estimation of Semi-Metric MRFs via Hierarchical Graph CutsPreprint
Kumar, M., & Koller, D. (2009) · Conference on Uncertainty in Artificial Intelligence · doi:10.48550/arxiv.1205.2633 · Cited by 39
Beyond trees: MRF inference via outer-planar decomposition
Batra, D., Gallagher, A., Parikh, D., & Chen, T. (2010) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2010.5539951 · Cited by 33
Analyzing the Subspace Structure of Related Images: Concurrent Segmentation of Image Sets
Mukherjee, L., Singh, V., Xu, J. W., & Collins, M. D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33765-9_10 · Cited by 33
Kahl, F., & Strandmark, P. (2012) · Discrete Applied Mathematics · doi:10.1016/j.dam.2012.06.009 · Cited by 33
Quantum annealing for systems of polynomial equations
Chang, C. C., Gambhir, A. S., Humble, T. S., & Sota, S. (2019) · Scientific Reports · doi:10.1038/s41598-019-46729-0 · Cited by 36
An Efficient Optimization Framework for Multi-Region Segmentation Based on Lagrangian Duality
Ulén, J., Strandmark, P., & Kahl, F. (2012) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2012.2218117 · Cited by 33
The Power of Sherali--Adams Relaxations for General-Valued CSPs
Thapper, J., & Živný, S. (2017) · SIAM Journal on Computing · doi:10.1137/16m1079245 · Cited by 33
Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above Average
Crowston, R., Gutin, G., Jones, M., Kim, E. J., & Ruzsa, I. Z. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13731-0_17 · Cited by 32
Towards the geometry of estimation of distribution algorithms based on the exponential family
Malagò, L., Matteucci, M., & Pistone, G. (2011) · Foundations of Genetic Algorithms · doi:10.1145/1967654.1967675 · Cited by 32
Inference for order reduction in Markov random fields
Gallagher, A., Batra, D., & Parikh, D. (2011) · doi:10.1109/cvpr.2011.5995452 · Cited by 32
On Quadratization of Pseudo-Boolean Functions
Boros, E., & Gruber, A. (2014) · arXiv · doi:10.48550/arxiv.1404.6538 · Cited by 32
Self-citationProactive Caching Strategies in Heterogeneous Networks With Device-to-Device Communications
Quer, G., Pappalardo, I., Rao, B. D., & Zorzi, M. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2840976 · Cited by 31
A Flexible Tensor Block Coordinate Ascent Scheme for Hypergraph MatchingPreprint
Nguyen, Q., Gautier, A., & Hein, M. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.07907 · Cited by 31
Skew Bisubmodularity and Valued CSPs
Huber, A. L., Krokhin, A., & Powell, R. D. (2014) · SIAM Journal on Computing · doi:10.1137/120893549 · Cited by 30
Generalized roof duality for pseudo-boolean optimization
Kahl, F., & Strandmark, P. (2011) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2011.6126250 · Cited by 30
Dense Non-rigid Structure from Motion
Russell, C., Fayad, J. K., & Agapito, L. (2012) · International Conference on 3D Imaging, Modeling, Processing, Visualization & Transmission · doi:10.1109/3dimpvt.2012.70 · Cited by 30
Solving larger maximum clique problems using parallel quantum annealing
Pelofske, E., Hahn, G., & Djidjev, H. N. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03962-x · Cited by 31
Borrero, J. S., Gillen, C. P., & Prokopyev, O. A. (2016) · Operations Research Letters · doi:10.1016/j.orl.2016.03.015 · Cited by 30
Equal Risk Bounding is better than Risk Parity for portfolio selection
Cesarone, F., & Tardella, F. (2016) · Journal of Global Optimization · doi:10.1007/s10898-016-0477-6 · Cited by 30
Metadata
- Authors
- Boros, E., & Hammer, P. L.
- Affiliations
- Rutgers, The State University of New Jersey (US)
- Corresponding author
- Boros, Endre
- Venue
- Discrete Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 2002-11
- Volume
- 123
- Issue
- 1-3
- Pages
- 155-225
- ISSN
- 0166-218X (ISSN-L)
- OpenAlex
- W2074078071
- Cited by
- 827
- References
- 162
- Citations by year
- 2026: 34 · 2025: 34 · 2024: 27 · 2023: 33 · 2022: 32 · 2021: 28 · 2020: 35 · 2019: 39 · 2018: 42 · 2017: 38 · 2016: 35 · 2015: 43 · 2014: 62 · 2013: 58 · 2012: 52
- FWCI
- 9.97
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Discrete Applied Mathematics (publishedVersion)
- Rutgers University Community Repository (Rutgers University) (submittedVersion)
- ORBi (University of Liège) (submittedVersion, other-oa)
- Funders
- National Science Foundation (9806389)
- Office of Naval Research (N00014-92-J-1375, N00014)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Keywords
- pseudo-Boolean optimization, set functions, algebraic expressions, approximation algorithms, combinatorial optimization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
