Pseudo-Boolean optimization

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

Untitled work

(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

A Value for n-person Games

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

Tabu Search—Part II

Glover, F. (1990) · INFORMS journal on computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,777

Tabu Search—Part I

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

Multilinear Objective Function-based Clustering

Rossi, G. (2015) · International Joint Conference on Computational Intelligence · doi:10.5220/0005592701410149 · Cited by 2

Algorithmic and complexity results for boolean and pseudo-boolean functions

Gruber, A. (2015) · doi:10.7282/t3pz5bhq · Cited by 2

Cones of Nonnegative Quadratic Pseudo-Boolean Functions

Boros, E., & Lari, I. (2014) · IRIS Research product catalog (Sapienza University of Rome) · Cited by 2

A Method to Convert Integer Variables of Mixed Integer Programming Problems into Continuous Variables

Hong, C.-C., & Huang, Y. (2013) · Springer eBooks · doi:10.1007/978-3-642-40060-5_98 · Cited by 2

Network Flow Formulations for Learning Binary Hashing

Mukherjee, L., Peng, J., Sigmund, T., & Singh, V. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-46454-1_23 · Cited by 2

Markov random fields and the optical flow

Opitz, F. (2011) · Cited by 2

Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS-15)

Barták, R., & Salido, M. Á. (2015) · Cited by 2

A speedup scheme for MRF stereo using local label hierarchy

Leelhapantu, S., & Chalidabhongse, T. H. (2018) · Signal Image and Video Processing · doi:10.1007/s11760-018-1277-x · Cited by 2

Automatic enforcement of expressive security policies using enclaves

Gollamudi, A., & Chong, S. (2016) · ACM SIGPLAN Notices · doi:10.1145/3022671.2984002 · Cited by 2

On Some Variants of the Merging Variables Based (1+1)-Evolutionary Algorithm with Application to MaxSAT Problem

Semenov, A., Otpuschennikov, I. V., & Валентинович, А. К. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77876-7_8 · Cited by 2

Pseudo-Boolean Conditional Optimization Models for a Class of Multiple Traveling Salesmen Problems

Germanchuk, M. S., Kozlova, M. G., & Lukianenko, V. A. (2021) · Automation and Remote Control · doi:10.1134/s0005117921100040 · Cited by 2

The Study of the Target Set Selection Problem under Deterministic Linear Threshold Model Using Evolutionary Algorithms

Smirnov, M., Kochemazov, S., & Semenov, A. (2023) · International Convention on Information and Communication Technology, Electronics and Microelectronics · doi:10.23919/mipro57284.2023.10159906 · Cited by 2

Design of General Purpose Minimal-Auxiliary Ising Machines

Martin, I. K., Moore, A. G., Daly, J. T., Meyer, J. J., & Ranadive, T. (2023) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc60800.2023.10386525 · Cited by 1

Generalized network design polyhedra

Feremans, C., Labbé, M., Letchford, A. N., & Salazar‐González, J. (2011) · Networks · doi:10.1002/net.20455 · Cited by 2

Comparing planning problem compilation approaches for quantum annealing

O’Gorman, B., Rieffel, E. G., Do, M., Venturelli, D., & Frank, J. (2016) · The Knowledge Engineering Review · doi:10.1017/s0269888916000278 · Cited by 2

Adaptive and Move Making Auxiliary Cuts for Binary Pairwise Energies

Gorelick, L., Boykov, Y. Y., & Veksler, O. (2017) · 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.2017.642 · Cited by 2

Approximation Speed-Up by Quadratization on LeadingOnes

Sutton, A. M., & Whitley, D. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-58115-2_48 · Cited by 2

Configuration Checking and Design Optimization of Storage Area Networks

Gençay, E. (2009) · Cited by 2

A new method for learning pseudo-Boolean functions with applications in terrorists profiling

Chen, J. I.-H., Chen, P. P.-S., Ding, G., & Lax, R. F. (2005) · IEEE Conference on Cybernetics and Intelligent Systems · doi:10.1109/iccis.2004.1460418 · Cited by 2

Submodularization for Quadratic Pseudo-Boolean OptimizationPreprint

Gorelick, L., Boykov, Y. Y., Veksler, O., Ayed, I. B., & Delong, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.1856 · Cited by 2

ESSP: An Efficient Approach to Minimizing Dense and Nonsubmodular Energy FunctionsPreprint

Feng, W., Jia, J., & Liu, Z.-Q. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.4583 · Cited by 2

Geometric and algebraic approaches to mixed-integer polynomial optimization using sos programming

Behrends, S. (2017) · doi:10.53846/goediss-6621 · Cited by 2

Marginal Weighted Maximum Log-likelihood for Efficient Learning of Perturb-and-Map modelsPreprint

Shpakova, T., Bach, F., & Osokin, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.08725 · Cited by 2

Discrete Optimization of Ray Potentials for Semantic 3D ReconstructionPreprint

Savinov, N., Ladický, Ľ., Häne, C., & Pollefeys, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.10491 · Cited by 2

Efficient Conversion of Bayesian Network Learning into Quadratic Unconstrained Binary Optimization.Preprint

Shikuri, Y. (2020) · arXiv (Cornell University) · Cited by 2

Short Prime Quadratizations of Cubic Negative Monomials

Crama, Y., & Rodríguez-Heck, E. (2014) · Open Repository and Bibliography (University of Liège) · Cited by 2

Boole’s Probability Bounding Problem, Linear Programming Aggregations, and Nonnegative Quadratic Pseudo-Boolean Functions

Boros, E., & Lee, J. (2025) · Mathematics of Operations Research · doi:10.1287/moor.2023.0019 · Cited by 1

QUBO Software

Woods, B., Kochenberger, G. A., & Punnen, A. P. (2022) · Springer eBooks · doi:10.1007/978-3-031-04520-2_11 · Cited by 1

Physics-Inspired Optimization in the QUBO Framework: Key Concepts and Approaches

Yu, L.-P., & Nien, C.-F. (2023) · SPIN · doi:10.1142/s2010324723400167 · Cited by 1

An ODE Approach to Multiple Choice Polynomial Programming

Shao, S., & Wu, Y. (2024) · East Asian Journal on Applied Mathematics · doi:10.4208/eajam.2023-184.151023 · Cited by 1

It’s Quick to be Square: Fast Quadratisation for Quantum Toolchains

Schmidbauer, L., Lobe, E., Schaefer, I., & Mauerer, W. (2026) · ACM Transactions on Quantum Computing · doi:10.1145/3800943 · Cited by 2

Impact of Network Complexity on the Computational Performance of Ising Machines

Hong, S. (2025) · IEEE Access · doi:10.1109/access.2025.3586179 · Cited by 1

How Partition Crossover Exposes Parallel Lattices and the Fractal Structure of k-Bounded Functions

Whitley, D., Ochoa, G., & Chicano, F. (2025) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3712256.3726340 · Cited by 1

QUBO: Quadratic Unconstrained Binary Optimization Problem

Kochenberger, G. A., Glover, F., & Wang, H. (2024) · Springer eBooks · doi:10.1007/978-1-4614-6624-6_15-1 · Cited by 1

Towards Optimizing Large-Scale Multi-Graph Matching in Bioimaging

Kahl, M., Stricker, S., Hutschenreiter, L., Bernard, F., Rother, C., & Savchynskyy, B. (2025) · 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/cvpr52734.2025.01080 · Cited by 1

Combining greedy and evolutionary algorithms to maximize influence in networks under deterministic linear threshold model

Andreev, A., Kochemazov, S., & Semenov, A. (2025) · PLoS ONE · doi:10.1371/journal.pone.0331109 · Cited by 1

Qubit‐Efficient Quantum Local Search for Combinatorial Optimization

Podobrii, M., Kuzmin, V., Voloshinov, V., Veshchezerova, M., & Perelshtein, M. R. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.202500438 · Cited by 1

Gray-Box Bi-objective Boolean Optimization Using Deterministic Recombination with Iterated Local Search

Kurivella, S., Whitley, D., Chicano, F., Ochoa, G., Cecere, F., & Derbel, B. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-20537-7_7 · Cited by 1

Vista: Verifier-in-the-Loop Agentic Reinforcement Learning for Quantum Program Synthesis

Yu, C., Shi, T., Uotila, V., Deng, S., You, L., & Zhao, B. (2026) · ACM Conference on AI and Agentic Systems (CAIS) · doi:10.1145/3786335.3813148 · Cited by 1

Bounds for Binary Integer Programming via Unconstrained Quadratic Pseudo-Boolean Optimization

Phonin, S., & Likasiri, C. (2026) · Mathematics · doi:10.3390/math14162968 · Cited by 1

How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem?

Průša, D., & Werner, T. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-14612-6_5 · Cited by 1

MRF optimization by graph approximation

Kim, W., & Lee, K. 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.7298709 · Cited by 1

Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width

Gutin, G., & Yeo, A. (2012) · Discrete Applied Mathematics · doi:10.1016/j.dam.2012.04.020 · Cited by 1

MAP estimation in Binary MRFs via Bipartite Multi-cuts

Reddi, S. J., Sarawagi, S., & Vishwanathan, S. (2010) · Cited by 1

The class of nearest belief functions to a given probability measure

Lepskiy, A. (2008) · Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) · doi:10.1109/nafips.2008.4531317 · Cited by 1

Data Storage Control System Design

Шумилов, Ю. Ю., & Dudakov, N. S. (2014) · Modern Applied Science · doi:10.5539/mas.v9n4p67 · Cited by 1

Multivariate arrival rate estimation using semidefinite programming

Papp, D., & Alizadeh, F. (2011) · Winter Simulation Conference · doi:10.5555/2431518.2431849 · Cited by 1

Optimization via Information Geometry

Malagò, L., & Pistone, G. (2014) · Springer proceedings in mathematics & statistics · doi:10.1007/978-1-4939-2104-1_33 · Cited by 1

Minimizing Count-Based High Order Terms in Markov Random Fields

Schoenemann, T. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23094-3_2 · Cited by 1

Application of the PMP to Cell Formation in Group Technology

Goldengorin, B. I., Krushinsky, D., & Pardalos, P. M. (2013) · Springer optimization and its applications · doi:10.1007/978-1-4614-8002-0_3 · Cited by 1

Quadratization and Roof Duality of Markov Logic Networks

de Nijs, R., Landsiedel, C., Wollherr, D., & BUSS, M. J. (2016) · Journal of Artificial Intelligence Research · doi:10.1613/jair.5023 · Cited by 1

Continuous Optimization Methods for the Quadratic Assignment Problem

Huang, T. (2019) · Carolina Digital Repository (University of North Carolina at Chapel Hill) · doi:10.17615/k256-xr13 · Cited by 1

The Swap and Expansion moves revisited and fused

Leichter, I. (2009) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2009.5459455 · Cited by 1

ANNEALING-BASED ALGORITHM FOR SOLVING CVP AND SVP

Yamaguchi, J., Shimizu, T., Furukawa, K., Ohori, R., Shimoyama, T., Mandal, A., Montgomery, H. W., Roy, A., & Ohwa, T. (2022) · Journal of the Operations Research Society of Japan · doi:10.15807/jorsj.65.121 · Cited by 1

A new phase unwrapping method for cross-track interferometric synthetic aperture radar systems

Darang, R., Nasri, S., & Zeinali, M. (2022) · Measurement · doi:10.1016/j.measurement.2022.112142 · Cited by 1

APPROACH TO SOLVING THE PROBLEM OF SECTOR FORMATION IN ORGANIZING THE WORK OF DRIVERS AT THE ENTERPRISES OF ROUTE PASSENGER TRANSPORT BASED ON PSEUDOBOOLEAN OPTIMIZATION

Капский, Д. В., Sarazhinsky, D. S., & Semtchenkov, S. (2023) · Herald of Polotsk State University Series B Industry Applied Sciences · doi:10.52928/2070-1616-2023-47-1-77-81 · Cited by 1

Конкурентні моделі розміщення центрів обслуговування клієнтів

Symonov, D. (2023) · Науковий вісник Ужгородського університету Серія Математика і інформатика · doi:10.24144/2616-7700.2023.42(1).208-215 · Cited by 1

Using Linearizing Sets to Solve Multivariate Quadratic Equations in Algebraic Cryptanalysis

Semenov, A., Валентинович, А. К., Kochemazov, S., & Pavlenko, A. (2023) · IEEE Access · doi:10.1109/access.2023.3328215 · Cited by 1

High-order-modulation large MIMO detector based on physics-inspired methods

Zeng, Q., Cui, X., Tao, X.-Z., Hu, J.-Q., Pan, S., Sha, W. E. I., & Yung, M. (2025) · Physical Review Applied · doi:10.1103/zmgv-m2ql · Cited by 1

Connections Between Continuous and Discrete Extremum Problems, Generalized Systems, andVariational Inequalities∗

Antoni, C., Giannessi, F., & Tardella, F. (2013) · Springer eBooks · doi:10.1007/978-1-4419-7997-1_54 · Cited by 1

Comparison of PBO solvers in a dependency solving domain

Trezentos, P. (2010) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.29.3 · Cited by 1

Minimization of Monotonically Levelable Higher Order MRF Energies via Graph Cuts

Karci, M. H., & Demırekler, M. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2069670 · Cited by 1

A Tractable Class of Binary VCSPs via M-Convex Intersection

Hirai, H., Iwamasa, Y., Murota, K., & Živný, S. (2019) · ACM Transactions on Algorithms · doi:10.1145/3329862 · Cited by 1

Integrating Pseudo-Boolean Constraint Reasoning in Multi-Objective Evolutionary Algorithms

Terra-Neves, M., Lynce, I., & Manquinho, V. M. (2019) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/165 · Cited by 1

K-spin Hamiltonian for quantum-resolvable Markov decision processes

Jones, E., Graf, P., Kapit, E., & Jones, W. (2020) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00026-6 · Cited by 2

Cuts in Undirected Graphs. I

Sharifov, F. A., & Hulianytskyi, L. (2020) · Cybernetics and Systems Analysis · doi:10.1007/s10559-020-00272-3 · Cited by 1

Using inverse backdoors sets to construct guess-and-determine attacks on hash-functions md4

Gribanova, I., & Semenov, A. (2020) · Prikladnaya diskretnaya matematika Prilozhenie · doi:10.17223/2226308x/13/37 · Cited by 1

On the Use of Gray Codes for Solving 0-1 Combinatorial Problems of Optimization in Environmental and Economic Systems

Trofymchuk, O. M., Vasyanin, V., Sokolov, V. Y., Chikrii, A. A., & Ushakova, L. (2022) · Cybernetics and Computer Technologies · doi:10.34229/2707-451x.22.4.2 · Cited by 1

Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation

Liang, R. N., Anacleto, E. A. J., & Meneses, C. N. (2023) · Computers & Operations Research · doi:10.1016/j.cor.2023.106324 · Cited by 1

A Pseudo-Boolean Optimization for Multiple Criteria Decision Making in Complex Systems

Alidaee, B., Wang, H., & Xu, Y. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72590-9_29 · Cited by 1

Estimating Maximally Probable Constrained Relations by Mathematical ProgrammingPreprint

Qu, L., & Andres, B. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.0838 · Cited by 1

Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity and Maximality

Chevaleyre, Y., Endriss, U., & Nicolas Maudet, B. (2008) · doi:10.1002/9780470611098.ch7 · Cited by 1

Supervised clustering with structural svms

Joachims, T., & Finley, T. (2009) · eCommons (Cornell University) · Cited by 1

Population Scalability Analysis of Abstract Population-based Random Search: I. Spectral RadiusPreprint

Chen, T., & He, J. (2012) · arXiv (Cornell University) · Cited by 1

Combinatorial Optimization for Infinite Games on Graphs

Björklund, H. (2005) · KTH Publication Database DiVA (KTH Royal Institute of Technology) · Cited by 1

Generalized roof duality and bisubmodular functionsPreprint

Kolmogorov, V. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.2305 · Cited by 1

Metaheuristic Agent Processes (MAPS)

Glover, F., & Kochenberger, G. A. (2005) · Springer eBooks · doi:10.1007/0-387-25383-1_1 · Cited by 1

Efficient Inference and Learning for Computer Vision Labelling Problems

Alahari, K. (2010) · Cited by 1

Photoflux Maximizing Shapes

Boykov, Y. Y., & Lempitsky, V. (2006) · Cited by 1

On Total Variation Minimization and Surface Evolution Using

Flows, P. M., Chambolle, A., & Darbon, J. (2009) · Cited by 1

A Penalty Function Approach to Max 3-SAT ProblemsPreprint

Kofler, C., Greistorfer, P., Wang, H., & Kochenberger, G. A. (2014) · RePEc: Research Papers in Economics · Cited by 1

Efficient Pose and Cell Segmentation using Column GenerationPreprint

Wang, S., Zhang, C., Ballester, M. Á. G., & Yarkony, J. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.00437 · Cited by 1

Uncertainty Driven Multi-scale Energy Minimization

Kohli, P., Lempitsky, V., & Rother, C. (2010) · Cited by 1

Multilinear objective function-based clusteringPreprint

Rossi, G. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.08456 · Cited by 1

The Potential of Quantum Annealing for Rapid Solution Structure Identification [Slides]

Coffrin, C., & (NNSA), U. N. N. S. A. (2020) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1599019 · Cited by 1

Challenge: A Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks.Preprint

Kasi, S., Warburton, P. A., Kaewell, J., & Jamieson, K. (2021) · arXiv (Cornell University) · Cited by 1

Ising formulations of some graph-theoretic problems in psychological research: models and methodsPreprint

Brusco, M. J., Davis‐Stober, C. P., & Steinley, D. (2020) · doi:10.31234/osf.io/4udfw · Cited by 1

Multi-dimensional Parametric Mincuts for Constrained MAP InferencePreprint

Lim, Y., Jung, K., & Kohli, P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1307.7793 · Cited by 1

Expressibility of Fixed-Arity Languages

Živný, S. (2012) · Cognitive technologies · doi:10.1007/978-3-642-33974-5_3

Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions

Ding, G., Lax, R. F., Chen, P. P.-S., & Chen, J. (2007) · Journal of Advanced Computational Intelligence and Intelligent Informatics · doi:10.20965/jaciii.2007.p0403

EFFICIENT RESOURCE ALLOCATION IN A BILEVEL HIERARCHY WITH KNAPSACK AND ASSIGNMENT LOWER-LEVEL PROBLEMS

Beheshti, B. (2014) · D-Scholarship@Pitt (University of Pittsburgh)

A step toward constant time local search for optimizing pseudo Boolean functions

Chen, W., Whitley, L. D., Howe, A. E., & Cheney, M. (2007) · Digital Collections of Colorado (Colorado State University) · doi:10.25675/3.024471

Research opportunities in creating medical images

Ramin Zabih, A. (2015) · Machine Vision Applications · doi:10.1109/mva.2015.7153100

A Stochastic Neural Model for Graph Problems: Software and Hardware Implementation

Grossi, G., & Pedersini, F. (2006) · International Conference on Neural Networks and Brain · doi:10.1109/icnnb.2005.1614579

Expressibility of Submodular Languages

Živný, S. (2012) · Cognitive technologies · doi:10.1007/978-3-642-33974-5_4

Improving the accuracy and scalability of discriminative learning methods for Markov logic networks

Huynh, T. N. (2011) · Texas ScholarWorks (Texas Digital Library)

Programmation mathématique en tomographie discrète

Tlig, G. (2013) · HAL · doi:10.70675/9cba6efazb9d4z4991zab19z6edaf018a5bb

The Swap, Expansion and Exwap Moves - A Simple Derivation and Implementation

Leichter, I. (2008)

Pseudo-Boolean Optimization: Theory and Applications in Vision

Strandmark, P., & Kahl, F. (2012)

Modularity-based decompositions for valued CSP

Helaoui, M., & Naanaa, W. (2013) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-013-9351-0

Algebraic method to pseudo-Boolean function and its application in pseudo-Boolean optimization

Li, Z., Song, J., & Xiao, H. (2012) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2012.6358288

On the Implementation of a Polynomial-Time Algorithm for Optimization of Quadratic Pseudo-Boolean Functions

Mulero-Martínez, J. I. (2020) · doi:10.13140/rg.2.2.16791.60321

Algorithms for solving pseudo-boolean optimization problems

Anacleto, E. A. J. (2023) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)

A polynomial-time algorithm for optimization of quadratic pseudo-boolean functions

Mulero-Martínez, J. I. (2020) · Digital Repository (Polytechnic University of Cartagena)

A Branch-and-Bound Algorithm for a Family of Pseudo-Boolean Optimization Problems

Bonates, T. O., & Hammer, P. L. (2007)