The following pages link to Pseudo-Boolean optimization (Q697569):
Displaying 50 items.
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- QUBO formulations of the longest path problem (Q2658047) (← links)
- Fixation probabilities in evolutionary dynamics under weak selection (Q2659034) (← links)
- The bipartite Boolean quadric polytope (Q2673249) (← links)
- The effects of the problem Hamiltonian parameters on the minimum spectral gap in adiabatic quantum optimization (Q2677153) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Synthesis of narrowing enquiries (Q2759376) (← links)
- Resource efficient gadgets for compiling adiabatic quantum optimization problems (Q2870496) (← links)
- A Semi-Tensor Product Approach to Pseudo-Boolean Functions with Application to Boolean Control Networks (Q2930802) (← links)
- Partition Crossover for Pseudo-Boolean Optimization (Q2981894) (← links)
- The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)
- Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY (Q2999550) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF (Q3453205) (← links)
- (Q3748067) (← links)
- Computing the Partition Function of a Polynomial on the Boolean Cube (Q4604373) (← links)
- The Multilinear Polytope for Acyclic Hypergraphs (Q4637506) (← links)
- Tangential Approximation of Surfaces (Q4682453) (← links)
- Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem (Q4965126) (← links)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
- Introduction to QUBO (Q5050141) (← links)
- Applications and Computational Advances for Solving the QUBO Model (Q5050142) (← links)
- Autarkies and Persistencies for QUBO (Q5050145) (← links)
- QUBO Software (Q5050151) (← links)
- Template-Based Minor Embedding for Adiabatic Quantum Optimization (Q5084660) (← links)
- Finding Effective SAT Partitionings Via Black-Box Optimization (Q5153508) (← links)
- Multi-period maintenance scheduling of tree networks with minimum flow disruption (Q5198690) (← links)
- Merging Variables: One Technique of Search in Pseudo-Boolean Optimization (Q5214427) (← links)
- Revisiting Deep Structured Models for Pixel-Level Labeling with Gradient-Based Inference (Q5230425) (← links)
- Diffusion methods for classification with pairwise relationships (Q5233998) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs (Q5378213) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5918755) (← links)
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5919301) (← links)
- Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation (Q6047870) (← links)
- Efficient joint object matching via linear programming (Q6052052) (← links)
- Ising Machines for Diophantine Problems in Physics (Q6091893) (← links)
- Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
- Generation of synchronizing state machines from a transition system: a region-based approach (Q6100077) (← links)
- On optimization problems in acyclic hypergraphs (Q6161450) (← links)
- On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)
- Efficient linear reformulations for binary polynomial optimization problems (Q6164618) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)
- A quantum annealing-sequential quadratic programming assisted finite element simulation for non-linear and history-dependent mechanical problems (Q6540435) (← links)
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231) (← links)
- Valued constraint satisfaction problems (Q6602254) (← links)
- New advances for quantum-inspired optimization (Q6609695) (← links)
- Comparing QUBO models for quantum annealing: integer encodings for permutation problems (Q6609696) (← links)
