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 501–600 of 825
Merging Variables: One Technique of Search in Pseudo-Boolean Optimization
Semenov, A. (2019) · Communications in computer and information science · doi:10.1007/978-3-030-33394-2_8 · Cited by 5
Optimal Control Problem of Boolean Control Networks: A Graph-theoretical Approach
Cui, X., Feng, J., & Wang, S. (2018) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2018.8407911 · Cited by 5
On the Lifted Multicut Polytope for Trees
Lange, J.-H., & Andres, B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-71278-5_26 · Cited by 5
Terse Integer Linear Programs for Boolean Optimization
Buchheim, C., & Rinaldi, G. (2009) · Journal on Satisfiability Boolean Modeling and Computation · doi:10.3233/sat190065 · Cited by 5
Best approximations of fitness functions of binary strings
Zhang, H., & Rowe, J. E. (2004) · Natural Computing · doi:10.1023/b:naco.0000023418.20610.4d · Cited by 5
Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY
Tischhauser, E. (2011) · Journal of Mathematical Cryptology · doi:10.1515/jmc.2011.001 · Cited by 5
Context-based global multi-class semantic image segmentation by wireless multimedia sensor networks
Wei, C., Jiang, X., Tang, Z., Wang, Q., & Fan, N. (2013) · Artificial Intelligence Review · doi:10.1007/s10462-013-9394-y · Cited by 5
Discriminative Learning with Markov Logic Networks
Huynh, T. N. (2009) · doi:10.21236/ada512664 · Cited by 5
A note on the primal-dual method for the semi-metric labeling problem
Kolmogorov, V. (2007) · UCL Discovery (University College London) · Cited by 5
Shift‐Add Circuits for Constant Multiplications
Meher, P. K., Chang, C., Gustafsson, O., Vinod, A. P., & Faust, M. (2017) · doi:10.1002/9781119206804.ch2 · Cited by 5
Partial Optimality by Pruning for MAP-Inference with General Graphical ModelsPreprint
Swoboda, P., Shekhovtsov, A., Kappes, J. H., Schnörr, C., & Savchynskyy, B. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.6641 · Cited by 5
Efficient QUBO transformation for Higher Degree Pseudo Boolean FunctionsPreprint
Verma, A., Lewis, M. W., & Kochenberger, G. A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.11695 · Cited by 5
Dynamic Programming in Economics on a Quantum Annealer
Fernández‐Villaverde, J., & Hull, I. (2023) · National Bureau of Economic Research · doi:10.3386/w31326 · Cited by 5
Revisiting Deep Structured Models for Pixel-Level Labeling with Gradient-Based Inference
Larsson, M., Arnab, A., Zheng, S., Torr, P. H. S., & Kahl, F. (2018) · SIAM Journal on Imaging Sciences · doi:10.1137/18m1167267 · Cited by 4
Huang, Z., Zhang, Y., Wang, X., Jiang, D., & Yao, E. (2024) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2024.3449693 · Cited by 4
Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits
Pezo, C., Hochbaum, D. S., Godoy, J., & Asín‐Achá, R. (2024) · Computers & Operations Research · doi:10.1016/j.cor.2024.106836 · Cited by 4
Generation of synchronizing state machines from a transition system: A region-based approach
Teren, V., Cortadella, J., & Villa, T. (2023) · International Journal of Applied Mathematics and Computer Science · doi:10.34768/amcs-2023-0011 · Cited by 4
Programming higher-order interactions of Rydberg atoms
Byun, A., Jeong, S., & Ahn, J. (2024) · Physical Review A · doi:10.1103/physreva.110.042612 · Cited by 4
Boosting quantum annealing performance through direct polynomial unconstrained binary optimization
Nagies, S., Geier, K. T., Akram, J., Bantounas, D., Johanning, M., & Hauke, P. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adcae6 · Cited by 4
Uotila, V. (2025) · Frontiers in Computer Science · doi:10.3389/fcomp.2025.1649354 · Cited by 4
Methods for Inference in Graphical Models
Weller, A. (2014) · doi:10.7916/d8jd4vdc · Cited by 4
Submodular Relaxation for MRFs with High-Order Potentials
Osokin, A., & Vetrov, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33885-4_31 · Cited by 4
Graph-based simplex method for pairwise energy minimization with binary variables
Průša, D. (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.7298645 · Cited by 4
Learning Weighted Lower Linear Envelope Potentials in Binary Markov Random Fields
Gould, S. J. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2366760 · Cited by 4
Norm bounds and underestimators for unconstrained polynomial integer minimization
Behrends, S., Hübner, R., & Schöbel, A. (2017) · Mathematical Methods of Operations Research · doi:10.1007/s00186-017-0608-y · Cited by 4
Memory Efficient Max Flow for Multi-label Submodular MRFs
Ajanthan, T., Hartley, R. I., & Salzmann, M. (2016) · 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.2016.632 · Cited by 4
Punnen, A. P. (2022) · Springer eBooks · doi:10.1007/978-3-031-04520-2_1 · Cited by 4
Dimensionality Reduction Using Pseudo-Boolean Polynomials for Cluster Analysis
Chikake, T. M., & Goldengorin, B. I. (2023) · Springer optimization and its applications · doi:10.1007/978-3-031-31654-8_4 · Cited by 4
Clausen, J., Crama, Y., Lusby, R. M., Rodríguez-Heck, E., & Røpke, S. (2024) · Computers & Operations Research · doi:10.1016/j.cor.2024.106586 · Cited by 4
Linearizing Binary Optimization Problems Using Variable Posets for Ising Machines
Ohno, K., & Togawa, N. (2024) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2024.3403871 · Cited by 4
Applying convex optimization techniques to energy minimization problems in computer vision
Taylor, C. J., & Bhusnurmath, A. (2008) · Cited by 4
A network approach for specially structured linear programs arising in 0–1 quadratic optimization
Adams, W. P., & Hadavas, P. T. (2007) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.08.035 · Cited by 4
Quadratic convex reformulations for quadratic 0–1 programming
Plateau, M.-C. (2007) · 4OR · doi:10.1007/s10288-007-0044-6 · Cited by 4
Efficient Learning of Pseudo-Boolean Functions from Limited Training Data
Ding, G., Chen, J., Lax, R. F., & Chen, P. (2005) · Lecture notes in computer science · doi:10.1007/11425274_34 · Cited by 4
Perception and Reasoning for Scene Understanding in Human-Robot Interaction Scenarios
Somani, N., Dean‐Leon, E., Cai, C., & Knoll, A. (2013) · Cited by 4
On the complexity and approximation of the maximum expected value all-or-nothing subset
(2018) · Digital Collections portal (Koç University) · Cited by 4
Novel Analysis of Population Scalability in Evolutionary AlgorithmsPreprint
He, J., Chen, T., & Mitavskiy, B. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.4531 · Cited by 4
Optimality and Reachability - Pseudo Boolean Power Flows for multi-sourced Vehicle Topologies
Kladis, G. P., Economou, J. T., Tsourdos, A., & White, B. A. (2007) · IEEE Vehicle Power and Propulsion Conference (VPPC) · doi:10.1109/vppc.2007.4544235 · Cited by 4
Markov Random Fields in Vision Perception: A Survey
Wang, C., & Nikos Paragios, A. (2012) · HAL · Cited by 4
New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems
Ghaddar, B. (2011) · UWSpace (University of Waterloo) · Cited by 5
Efficient Column Generation for Cell Detection and SegmentationPreprint
Zhang, C., Wang, S., Ballester, M. Á. G., & Yarkony, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.07337 · Cited by 4
Maximum-Likelihood Network Reconstruction for SIS Processes is NP-HardPreprint
Prasse, B., & Mieghem, P. V. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.08630 · Cited by 4
Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy MinimizationPreprint
Tourani, S., Shekhovtsov, A., Rother, C., & Savchynskyy, B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.07715 · Cited by 4
General integer factorization algorithm based on Ising machine
Luo, Z., Yuan, Y., Wang, Z., Lai, M., & Lu, P. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00449-9 · Cited by 3
Dynamic programming in economics on a quantum annealer
Fernández‐Villaverde, J., & Hull, I. (2026) · Quantitative Economics · doi:10.3982/qe2555 · Cited by 2
An initial step toward a quantum annealing approach to the discrete logarithm problem
Mahasinghe, A., & Jayasinghe, Y. (2022) · Security and Privacy · doi:10.1002/spy2.234 · Cited by 3
Enhancing quantum annealing in digital–analog quantum computing
Kadowaki, T. (2024) · APL Quantum · doi:10.1063/5.0179540 · Cited by 4
Hardness-dependent quantum adiabatic schedules for the maximum-independent-set problem
Perseguers, S. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.064023 · Cited by 6
The Complexity of Valued Constraint Models
Živný, S., & Jeavons, P. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04244-7_64 · Cited by 3
Neurite tracking in time-lapse calcium images using MRF-modeled pictorial structures
Gulyanon, S., He, L., Tracey, W. D., & Tsechpenakis, G. (2018) · IEEE International Symposium on Biomedical Imaging (ISBI) · doi:10.1109/isbi.2018.8363872 · Cited by 3
Optimal Neuron Selection and Generalization: NK Ensemble Neural Networks
Whitley, D., Tinós, R., & Chicano, F. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-99259-4_36 · Cited by 3
A gray box manifesto for evolutionary combinatorial optimization
Whitley, D. (2019) · ACM SIGEVOlution · doi:10.1145/3328473.3328474 · Cited by 3
Quantum- Inspired Structure- Preserving Probabilistic Inference
Mücke, S., & Piatkowski, N. (2022) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec55065.2022.9870260 · Cited by 3
Pseudo-Boolean Polynomials Approach to Edge Detection and Image Segmentation
Chikake, T. M., Goldengorin, B. I., & Samosyuk, A. (2023) · Springer optimization and its applications · doi:10.1007/978-3-031-31654-8_5 · Cited by 3
Quantum-compliant users scheduling optimization in joint transmission mobile access networks
Volpe, D., Cirillo, G., Fantini, R., Boella, A., Mondo, G., Graziano, M., & Turvani, G. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04471-1 · Cited by 6
Weighted Model Counting Without Parameter Variables
Dilkas, P., & Belle, V. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-80223-3_10 · Cited by 3
A General Framework Based on Walsh Decomposition for Combinatorial Optimization Problems
Unanue, I., Merino, M., & Lozano, J. A. (2021) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec45853.2021.9504699 · Cited by 3
Efficient joint object matching via linear programming
Rosa, A. D., & Khajavirad, A. (2023) · Mathematical Programming · doi:10.1007/s10107-023-01932-w · Cited by 3
On Unconstrained Quasi-Submodular Function Optimization
Mei, J., Zhao, K., & Lu, B. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9359 · Cited by 3
A Discrete Adaptive Stochastic Neural Model for Constrained Optimization
Grossi, G. (2006) · Lecture notes in computer science · doi:10.1007/11840817_67 · Cited by 3
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials
Gupta, R., Sarawagi, S., & Diwan, A. A. (2010) · doi:10.5555/1756006.1953032 · Cited by 3
A Tight Lower Bound for a Special Case of Quadratic 0–1 Programming
Palubeckis, G. (2006) · Computing · doi:10.1007/s00607-005-0153-z · Cited by 3
Uniqueness in quadratic and hyperbolic 0–1 programming problems
Deı̌neko, V. G., Klinz, B., & Woeginger, G. J. (2013) · Operations Research Letters · doi:10.1016/j.orl.2013.08.013 · Cited by 3
Near-Boolean Optimization: A Continuous Approach to Set Packing and Partitioning
Rossi, G. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-53375-9_4 · Cited by 3
A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
Chen, W.-A., Zhu, Z., & Kong, N. (2017) · Optimization Letters · doi:10.1007/s11590-017-1125-x · Cited by 3
Mokhov, A., Cortadella, J., & de Gennaro, A. (2017) · International Conference on Application of Concurrency to System Design (ACSD) · doi:10.1109/acsd.2017.18 · Cited by 3
Evaluating the Effectiveness of D-chains in SAT-based ATPG and Diagnostic TPG
Raiola, P., Burchard, J., Neubauer, F., Erb, D., & Becker, B. (2017) · Journal of Electronic Testing · doi:10.1007/s10836-017-5693-6 · Cited by 3
Memory Efficient Max Flow for Multi-Label Submodular MRFs
Ajanthan, T., Hartley, R. I., & Salzmann, M. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2819675 · Cited by 3
A Novel Method for Solving Simultaneous Equations in Boolean/Switching Algebra
Bhattacharjee, P. R. (2018) · IETE Journal of Education · doi:10.1080/09747338.2018.1465364 · Cited by 3
On Robust Fractional 0-1 Programming
Mehmanchi, E., Gillen, C. P., Gómez, A., & Prokopyev, O. A. (2020) · INFORMS Journal on Optimization · doi:10.1287/ijoo.2019.0025 · Cited by 3
Completed Dense Scene Flow in RGB-D Space
Wang, Y., Zhang, J., Liu, Z., Wu, Q., Chou, P. A., Zhang, Z., & Jia, Y. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-16628-5_14 · Cited by 3
Critical Infrastructure Management for Telecommunication Networks
Wang, H., Alidaee, B., & Wang, W. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35236-2_49 · Cited by 3
Diffusion methods for classification with pairwise relationships
Felzenszwalb, P. F., & Svaiter, B. F. (2019) · Quarterly of Applied Mathematics · doi:10.1090/qam/1540 · Cited by 3
Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional
Zacatenco, U. (2013) · Cited by 3
Quadratic Optimization in 0–1 Variables
Billionnet, A. (2014) · doi:10.1002/9781119005216.ch8 · Cited by 3
FPGA Implementation of an Adaptive Stochastic Neural Model
Grossi, G., & Pedersini, F. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74690-4_57 · Cited by 3
On Partial Opimality by Auxiliary Submodular ProblemsPreprint
Shekhovtsov, A., & Hlaváč, V. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.1149 · Cited by 3
Does Greater Diversification Really Improve Performance in Portfolio Selection?Preprint
Cesarone, F., Moretti, J., & Tardella, F. (2014) · SSRN Electronic Journal · doi:10.2139/ssrn.2473630 · Cited by 3
Class Subset Selection for Transfer Learning using SubmodularityPreprint
Manjunatha, V., Ramalingam, S., Marks, T. K., & Davis, L. S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.00060 · Cited by 4
Event Recognition Under Uncertainty and Incomplete Data
Skarlatidis, A., & Σκαρλατίδης, Α. (2014) · Cited by 3
Pelofske, E., Hahn, G., & Djidjev, H. N. (2025) · npj Unconventional Computing · doi:10.1038/s44335-025-00032-6 · Cited by 2
RSQC: Recursive Sparse QUBO Construction for Quantum Annealing Machines
Luo, J., Shu, Y., & Ha, Y. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3557965 · Cited by 2
Nakada, H., & Tanaka, S. (2025) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.94.094801 · Cited by 2
Jiang, Y., Zheng, Z., Yuan, S., Xue, H., Li, L., & Sha, W. E. I. (2025) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2025.3619563 · Cited by 2
Efficient branch-and-bound algorithms for weighted MAX-2-SAT
Ibaraki, T., Imamichi, T., Koga, Y., Nagamochi, H., Nonobe, K., & Yagiura, M. (2009) · Mathematical Programming · doi:10.1007/s10107-009-0285-6 · Cited by 2
On don’t cares in test compression
Balcárek, J., Fišer, P., & Schmidt, J. (2014) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2014.07.006 · Cited by 2
Critical Infrastructure Management for Telecommunication Networks
Wang, H., Alidaee, B., Wang, W., & Ning, W. (2014) · International Journal of Knowledge and Systems Science · doi:10.4018/ijkss.2014010101 · Cited by 2
Submodular Function Maximization for Group Elevator Scheduling
Ramalingam, S., Raghunathan, A. U., & Nikovski, D. N. (2017) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v27i1.13799 · Cited by 2
Improved N-dimensional data visualization from hyper-radial values
Paciencia, T. J., Bihl, T., & Bauer, K. W. (2019) · Journal of Algorithms & Computational Technology · doi:10.1177/1748302619873602 · Cited by 2
Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem
Otpuschennikov, I. V., & Semenov, A. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-58657-7_29 · Cited by 2
On optimization problems in acyclic hypergraphs
Kamiyama, N. (2023) · Information Processing Letters · doi:10.1016/j.ipl.2023.106390 · Cited by 2
Image edge detection using pseudo-Boolean polynomials
Chikake, T. M., & Goldengorin, B. I. (2024) · International Conference on Machine Vision · doi:10.1117/12.3023452 · Cited by 2
Uotila, V. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00053 · Cited by 3
SAT-Based Generation of Optimum Circuits with Polymorphic Behavior Support
Fišer, P., Háleček, I., Schmidt, J., & Šimek, V. (2019) · Journal of Circuits Systems and Computers · doi:10.1142/s0218126619400103 · Cited by 2
Improved hierarchical conditional random field model for object segmentation
Wang, L., & Yung, N. H. C. (2015) · Machine Vision and Applications · doi:10.1007/s00138-015-0708-8 · Cited by 2
Goldengorin, B. I., Krushinsky, D., & Pardalos, P. M. (2013) · Springer optimization and its applications · doi:10.1007/978-1-4614-8002-0_2 · Cited by 2
Observability-based coverage-directed path search using PBO for automatic test vector generation
Costa, J. C., & Monteiro, J. C. (2009) · IFIP International Conference on Very Large Scale Integration (VLSI-SoC) · doi:10.1109/vlsisoc.2009.6041346 · Cited by 2
Stereo correspondence using multi-label QPBO method
Leelhapantu, S., & Chalidabhongse, T. H. (2014) · IEEE International Conference on Digital Signal Processing (DSP) · doi:10.1109/icdsp.2014.6900823 · Cited by 2
Du, J., Qi, G., & Pan, J. Z. (2010) · Tsinghua Science & Technology · doi:10.1016/s1007-0214(10)70109-7 · Cited by 2
Continuous Set Packing and Near-Boolean Functions
Rossi, G. (2016) · International Conference on Pattern Recognition Applications and Methods · doi:10.5220/0005697800840096 · Cited by 2
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
