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 201–300 of 825
Convexity Shape Prior for Segmentation
Gorelick, L., Veksler, O., Boykov, Y. Y., & Nieuwenhuis, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10602-1_44 · Cited by 29
Solving large minimum vertex cover problems on a quantum annealer
Pelofske, E., Hahn, G., & Djidjev, H. (2019) · ACM International Conference on Computing Frontiers · doi:10.1145/3310273.3321562 · Cited by 37
A QUBO Formulation of Minimum Multicut Problem Instances in Trees for D-Wave Quantum Annealers
Cruz-Santos, W., Venegas-Andraca, S. E., & Lanzagorta, M. O. (2019) · Scientific Reports · doi:10.1038/s41598-019-53585-5 · Cited by 28
Analytical framework for quantum alternating operator ansätze
Hadfield, S., Hogg, T., & Rieffel, E. G. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/aca3ce · Cited by 36
Maronese, M., Moro, L. D., Rocutto, L., & Prati, E. (2022) · Springer eBooks · doi:10.1007/978-3-030-89746-8_2 · Cited by 33
A microarchitecture-based framework for pre- and post-silicon power delivery analysis
Ketkar, M., & Chiprout, E. (2009) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/1669112.1669136 · Cited by 29
A new modeling and solution approach for the number partitioning problem
Alidaee, B., Glover, F., Kochenberger, G. A., & Rego, C. (2005) · Journal of Applied Mathematics and Decision Sciences · doi:10.1155/jamds.2005.113 · Cited by 29
New approaches for optimizing over the semimetric polytope
Frangioni, A., Lodi, A., & Rinaldi, G. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0620-5 · Cited by 29
Combinatorial Optimization on Gate Model Quantum Computers: A Survey
Zahedinejad, E., & Zaribafiyan, A. (2017) · arXiv · doi:10.48550/arxiv.1708.05294 · Cited by 29
Mixed-Variable Bayesian Optimization
Daxberger, E., Makarova, A., Turchetta, M., & Krause, A. (2019) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000385835 · Cited by 29
Solving mixed integer linear and nonlinear problems using the SCIP Optimization Suite
Berthold, T., Gamrath, G., Gleixner, A., Heinz, S., Koch, T., & Shinano, Y. (2012) · Cited by 28
Kappes, J. H., Speth, M., Reinelt, G., & Schnörr, C. (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.229 · Cited by 28
Coarse-to-Fine Semantic Video Segmentation Using Supervoxel Trees
Jain, A., Chatterjee, S., & Vidal, R. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.234 · Cited by 28
Data aggregation for p-median problems
AlBdaiwi, B. F., Ghosh, D., & Goldengorin, B. I. (2009) · Journal of Combinatorial Optimization · doi:10.1007/s10878-009-9251-8 · Cited by 28
Using the unconstrained quadratic program to model and solve Max 2-SAT problems
Kochenberger, G. A., Glover, F., Alidaee, B., & Lewis, K. R. (2005) · International Journal of Operational Research · doi:10.1504/ijor.2005.007435 · Cited by 28
Primal-dual Algorithm for Convex Markov Random Fields
Kolmogorov, V. (2005) · Cited by 28
Generalized roof duality and bisubmodular functions
Kolmogorov, V. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.10.026 · Cited by 27
Large-Scale Price Optimization via Network Flow
Ito, S., & Fujimaki, R. (2016) · neural information processing systems · Cited by 27
The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases
Punnen, A. P., Sripratak, P., & Karapetyan, D. (2015) · Discrete Applied Mathematics · doi:10.1016/j.dam.2015.04.004 · Cited by 27
Pose Estimation and Segmentation of People in 3D Movies
Alahari, K., Seguin, G., Šivic, J., & Ivan Laptev, A. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.263 · Cited by 27
An integrated programming and development environment for adiabatic quantum optimization
Humble, T. S., McCaskey, A., Bennink, R. S., Billings, J. J., D'Azevedo, E. F., Sullivan, B. D., Klymko, C., & Seddiqi, H. (2014) · Computational Science & Discovery · doi:10.1088/1749-4680/7/1/015006 · Cited by 27
MRFs forMRIs: Bayesian Reconstruction of MR Images via Graph Cuts
Raj, A., Singh, G., & Ramin Zabih, A. (2006) · 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.2006.192 · Cited by 27
Quadratization of symmetric pseudo-Boolean functions
Anthony, M., Boros, E., Crama, Y., & Gruber, A. (2016) · Discrete Applied Mathematics · doi:10.1016/j.dam.2016.01.001 · Cited by 26
Self-citationDomino, K., Kundu, A., Salehi, Ö., & Krawiec, K. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03670-y · Cited by 27
A Unified Framework for Modeling and Solving Combinatorial Optimization Problems: A Tutorial
Kochenberger, G. A., & Glover, F. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-387-29550-x_4 · Cited by 26
Relating Things and Stuff via ObjectProperty Interactions
Sun, M., Kim, B., Kohli, P., & Savarese, S. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.193 · Cited by 26
Distribution Matching with the Bhattacharyya Similarity: A Bound Optimization Framework
Ayed, I. B., Punithakumar, K., & Li, S. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2382104 · Cited by 20
An Efficient Multilinear Optimization Framework for Hypergraph Matching
Nguyen, Q., Tudisco, F., Gautier, A., & Hein, M. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2574706 · Cited by 26
Using xQx to model and solve the uncapacitated task allocation problem
Lewis, M. W., Alidaee, B., & Kochenberger, G. A. (2004) · Operations Research Letters · doi:10.1016/j.orl.2004.04.014 · Cited by 26
Learning Low-order Models for Enforcing High-order Statistics
Pletscher, P., & Kohli, P. (2012) · Cited by 25
The expressibility of functions on the Boolean domain, with applications to Counting CSPs
Bulatov, A. A., Dyer, M., Goldberg, L. A., Jerrum, M., & McQuillan, C. (2015) · Cited by 25
Calude, C. S., Calude, E., & Dinneen, M. J. (2015) · ACM SIGACT News · doi:10.1145/2744447.2744459 · Cited by 28
An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach
Li, D., Sun, X. L., & Liu, C. L. (2011) · Journal of Global Optimization · doi:10.1007/s10898-011-9713-2 · Cited by 25
Complexity of Discrete Energy Minimization Problems
Li, M., Shekhovtsov, A., & Huber, D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-46475-6_51 · Cited by 25
García, M. D., Ayodele, M., & Moraglio, A. (2022) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3520304.3528925 · Cited by 24
Classes of submodular constraints expressible by graph cuts
Živný, S., & Jeavons, P. (2009) · Constraints · doi:10.1007/s10601-009-9078-z · Cited by 24
The expressibility of functions on the boolean domain, with applications to counting CSPs
Bulatov, A. A., Dyer, M., Goldberg, L. A., Jerrum, M., & Mcquillan, C. (2013) · Journal of the ACM · doi:10.1145/2528401 · Cited by 24
Linear and quadratic reformulations of nonlinear optimization problems in binary variables
Rodríguez-Heck, E. (2018) · 4OR · doi:10.1007/s10288-018-0392-4 · Cited by 24
A Primal-Dual Algorithm for Higher-Order Multilabel Markov Random Fields
Fix, A., Wang, C., & Ramin Zabih, 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.149 · Cited by 23
Efficient minimization of higher order submodular functions using monotonic Boolean functions
Ramalingam, S., Russell, C., Ladický, Ľ., & Torr, P. H. S. (2017) · Discrete Applied Mathematics · doi:10.1016/j.dam.2016.11.022 · Cited by 24
Mk Landscapes, NK Landscapes, MAX-kSAT
Whitley, D. (2015) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2739480.2754809 · Cited by 23
Automatic enforcement of expressive security policies using enclaves
Gollamudi, A., & Chong, S. (2016) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/2983990.2984002 · Cited by 23
Choi, V. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-2582-1 · Cited by 23
Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer
Pelofske, E., Hahn, G., & Djidjev, H. N. (2020) · Journal of Signal Processing Systems · doi:10.1007/s11265-020-01550-1 · Cited by 23
Online multi-object tracking by quadratic pseudo-boolean optimization
Lan, L., Tao, D., Gong, C., Guan, N., & Luo, Z. (2016) · UTS ePRESS (University of Technology Sydney) · Cited by 23
Half-integrality based algorithms for cosegmentation of images
Mukherjee, L., Singh, V., & Dyer, C. R. (2009) · 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/cvprw.2009.5206652 · Cited by 23
Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study
Gemeinhardt, F., Garmendia, A., Wimmer, M., Weder, B., & Leymann, F. (2024) · ACM Computing Surveys · doi:10.1145/3620668 · Cited by 22
“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]), which are explained and compared in References [53, 62, 135, 218].”
MethodHough Forest Random Field for Object Recognition and Segmentation
Payet, N., & Todorović, S. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.194 · Cited by 22
Mapping graph coloring to quantum annealing
SILVA, C. V. D., Aguiar, A., Lima, P. M. V., & Dutra, I. (2020) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00028-4 · Cited by 23
Li, P., & Fang, S. (2009) · Journal of Systems Science and Complexity · doi:10.1007/s11424-009-9146-x · Cited by 22
Optimization by Stochastic Continuation
Robini, M. C., & Magnin, I. E. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/090756181 · Cited by 22
Hard combinatorial problems and minor embeddings on lattice graphs
Lucas, A. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2323-5 · Cited by 23
Chvátal Rank in Binary Polynomial Optimization
Pia, A. D., & Gregorio, S. D. (2021) · INFORMS Journal on Optimization · doi:10.1287/ijoo.2019.0049 · Cited by 22
Community Search over Big Graphs
Huang, X. S., Lakshmanan, L. V. S., & Xu, J. (2019) · Synthesis lectures on data management · doi:10.2200/s00928ed1v01y201906dtm061 · Cited by 22
A global continuation algorithm for solving binary quadratic programming problems
Pan, S., Tan, T., & Jiang, Y. (2007) · Computational Optimization and Applications · doi:10.1007/s10589-007-9110-4 · Cited by 22
Crowston, R., Fellows, M. R., Gutin, G., Jones, M., Rosamond, F., Thomassé, S., & Yeo, A. (2011) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.fsttcs.2011.229 · Cited by 21
Campbell, C., & Dahl, E. D. (2022) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c54293.2022.00035 · Cited by 21
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Cooper, M. (2008) · Constraints · doi:10.1007/s10601-007-9037-5 · Cited by 21
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
Ghaddar, B., Vera, J. C., & Anjos, M. F. (2011) · SIAM Journal on Optimization · doi:10.1137/100802190 · Cited by 21
Graph Cuts for Minimizing Robust Higher Order Potentials
Kohli, P., Ladický, Ľ., & Torr, P. H. S. (2008) · Cited by 21
Identification of Boolean Network Models From Time Series Data Incorporating Prior Knowledge
Leifeld, T., Zhang, Z., & Zhang, P. (2018) · Frontiers in Physiology · doi:10.3389/fphys.2018.00695 · Cited by 21
A QUBO Formulation of the Stereo Matching Problem for D-Wave Quantum Annealers
Cruz-Santos, W., Venegas-Andraca, S. E., & Lanzagorta, M. O. (2018) · Entropy · doi:10.3390/e20100786 · Cited by 21
Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions
Verma, A., & Lewis, M. W. (2019) · Optimization Letters · doi:10.1007/s11590-019-01460-7 · Cited by 21
Optimizing Binary MRFs with Higher Order Cliques
Ali, A., Farag, A. A., & Gimel’farb, G. L. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88690-7_8 · Cited by 21
Ochoa, G., Chicano, F., Tinós, R., & Whitley, D. (2015) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2739480.2754657 · Cited by 20
Evolutionary Computation Techniques for Constructing SAT-Based Attacks in Algebraic Cryptanalysis
Pavlenko, A., Semenov, A., & Игоревич, У. В. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-16692-2_16 · Cited by 20
A QUBO Formulation for Minimum Loss Network Reconfiguration
Silva, F. F. C., Carvalho, P. M. S., Ferreira, L. A. F. M., & Omar, Y. (2022) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2022.3214477 · Cited by 23
A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems
Kumar, T. K. S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85958-1_19 · Cited by 20
A New Encoding from MinSAT into MaxSAT
Zhu, Z., Li, C.-M., Manyà, F., & Argelich, J. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33558-7_34 · Cited by 20
Manthey, N., Philipp, T., & Steinke, P. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11206-0_13 · Cited by 20
Dynamic Graph Cuts and Their Applications in Computer Vision
Kohli, P., & Torr, P. H. S. (2010) · Computer Vision: Detection, Recognition and Reconstruction · doi:10.1007/978-3-642-12848-6_3 · Cited by 28
Extending Dynamic Software Product Lines with Temporal Constraints
Sousa, G., Rudametkin, W., & Duchien, L. (2017) · International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS) · doi:10.1109/seams.2017.6 · Cited by 20
Computational overhead of locality reduction in binary optimization problems
Valiante, E., Hernandez, M., Barzegar, A., & Katzgraber, H. G. (2021) · Computer Physics Communications · doi:10.1016/j.cpc.2021.108102 · Cited by 21
Caramia, M., & Pizzari, E. (2022) · Computers & Industrial Engineering · doi:10.1016/j.cie.2022.108297 · Cited by 19
Solving optimization problems with local light-shift encoding on Rydberg quantum annealers
Goswami, K., Mukherjee, R., Ott, H., & Schmelcher, P. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023031 · Cited by 18
Multiclass pixel labeling with non-local matching constraints
Gould, S. J. (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.6248002 · Cited by 19
Pose Estimation and Segmentation of Multiple People in Stereoscopic Movies
Seguin, G., Alahari, K., Šivic, J., & Ivan Laptev, A. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2369050 · Cited by 19
Berge-acyclic multilinear 0–1 optimization problems
Buchheim, C., Crama, Y., & Rodríguez-Heck, E. (2018) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.07.045 · Cited by 19
The fundamental theorem of linear programming: extensions and applications
Tardella, F. (2010) · Optimization · doi:10.1080/02331934.2010.506535 · Cited by 19
Quantum-Inspired Hierarchy for Rank-Constrained Optimization
Yu, X., Simnacher, T., Nguyen, H. C., & Gühne, O. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010340 · Cited by 22
Quantum Optimization Methods for Satellite Mission Planning
Makarov, A., Pérez-Herradón, C., Franceschetto, G., Taddei, M. M., Osaba, E., del Barrio, P., Villar-Rodríguez, E., & Oregi, I. (2024) · IEEE Access · doi:10.1109/access.2024.3402990 · Cited by 22
Relating Things and Stuff by High-Order Potential Modeling
Kim, B., Sun, M., Kohli, P., & Savarese, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33885-4_30 · Cited by 18
Communication lower bounds using directional derivatives
Sherstov, A. A. (2013) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2488608.2488725 · Cited by 18
Self-adaptation of service compositions through product line reconfiguration
Bashari, M., Ebrahim Bagheri, A., & Du, W. (2018) · Journal of Systems and Software · doi:10.1016/j.jss.2018.05.069 · Cited by 18
Quantum annealing algorithms for Boolean tensor networks
Pelofske, E., Hahn, G., O’Malley, D., Djidjev, H. N., & Alexandrov, B. S. (2022) · Scientific Reports · doi:10.1038/s41598-022-12611-9 · Cited by 21
Discrete-Continuous Optimization for Optical Flow Estimation
Roth, S., Lempitsky, V., & Rother, C. (2009) · Statistical and Geometrical Approaches to Visual Motion Analysis · doi:10.1007/978-3-642-03061-1_1 · Cited by 27
Solving Multilabel Graph Cut Problems with Multilabel Swap
Carr, P., & Hartley, R. I. (2009) · International Conference on Digital Image Computing: Techniques and Applications (DICTA) · doi:10.1109/dicta.2009.90 · Cited by 18
Submodular-Bregman and the Lovász-Bregman Divergences with Applications
Iyer, R., & Bilmes, J. (2012) · Cited by 18
Partial Optimality via Iterative Pruning for the Potts Model
Swoboda, P., Savchynskyy, B., Kappes, J. H., & Schnörr, C. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38267-3_40 · Cited by 17
Factoring semi-primes with (quantum) SAT-solvers
Mosca, M., & Verschoor, S. R. (2022) · Scientific Reports · doi:10.1038/s41598-022-11687-7 · Cited by 22
Domain-Wall / Unary Encoding in QUBO for Permutation Problems
Codognet, P. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00036 · Cited by 18
New advances for quantum‐inspired optimization
Du, Y., Wang, H., Hennig, R., Hulandageri, A., Kochenberger, G. A., & Glover, F. (2023) · International Transactions in Operational Research · doi:10.1111/itor.13420 · Cited by 17
Robust Timing-Aware Test Generation Using Pseudo-Boolean Optimization
Eggersglüß, S., Yilmaz, M., & Chakrabarty, K. (2012) · Proceedings - Asian Test Symposium/Proceedings · doi:10.1109/ats.2012.35 · Cited by 17
Variable grouping for energy minimization
Kim, T., Nowozin, S., Kohli, P., & Yoo, C. D. (2011) · doi:10.1109/cvpr.2011.5995645 · Cited by 17
Particle Algorithms for Optimization on Binary Spaces
Schäfer, C. (2013) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/2414416.2414424 · Cited by 17
Partial Optimality by Pruning for MAP-Inference with General Graphical Models
Swoboda, P., Shekhovtsov, A., Kappes, J. H., Schnörr, C., & Savchynskyy, B. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2484327 · Cited by 17
Unsupervised refinement of color and stroke features for text binarization
Mishra, A., Alahari, K., & Jawahar, C. V. (2017) · International Journal on Document Analysis and Recognition (IJDAR) · doi:10.1007/s10032-017-0283-9 · Cited by 17
Boolean-controlled systems via receding horizon and linear programing
Bauso, D. (2009) · Mathematics of Control Signals and Systems · doi:10.1007/s00498-009-0038-3 · Cited by 16
Saeidi, S. (2020) · Computational Social Networks · doi:10.1186/s40649-020-00077-6 · Cited by 17
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework
Björklund, H., Sandberg, S., & Vorobyov, S. G. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-39866-0_38 · Cited by 17
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
