Pages that link to "Item:Q405668"
From MaRDI portal
The following pages link to The unconstrained binary quadratic programming problem: a survey (Q405668):
Displayed 50 items.
- \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- Continuous representations and functional extensions in combinatorial optimization (Q508577) (← links)
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134) (← links)
- Properties of combinatorial optimization problems over polyhedral-spherical sets (Q1745702) (← links)
- Gaussian mean field lattice gas (Q1753883) (← links)
- The generalized vertex cover problem and some variations (Q1756348) (← links)
- Membership testing for Bernoulli and tail-dependence matrices (Q1795588) (← links)
- Biclustering with a quantum annealer (Q1800360) (← links)
- Embedding equality constraints of optimization problems into a quantum annealer (Q2003330) (← links)
- Shaken dynamics: an easy way to parallel Markov chain Monte Carlo (Q2087730) (← links)
- The variational quantum eigensolver: a review of methods and best practices (Q2092477) (← links)
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization (Q2102287) (← links)
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks (Q2150397) (← links)
- Modeling the Costas array problem in QUBO for quantum annealing (Q2163794) (← links)
- Model-based approaches to multi-attribute diverse matching (Q2170223) (← links)
- Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions (Q2193002) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- A semi-supervised random vector functional-link network based on the transductive framework (Q2282876) (← links)
- Assortment optimization under the multinomial logit model with product synergies (Q2294378) (← links)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- Optimization problems involving group sparsity terms (Q2330642) (← links)
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
- Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
- A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
- Penalty and partitioning techniques to improve performance of QUBO solvers (Q2673235) (← links)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Continuous Approaches to the Unconstrained Binary Quadratic Problems (Q2958833) (← links)
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization (Q4995079) (← links)
- Introduction to QUBO (Q5050141) (← links)
- Applications and Computational Advances for Solving the QUBO Model (Q5050142) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- On the Consistent Path Problem (Q5144803) (← 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)
- Graph minors from simulated annealing for annealing machines with sparse connectivity (Q6073022) (← links)
- Optimal sufficient requirements on the embedded Ising problem in polynomial time (Q6073965) (← links)
- Optimization via rejection-free partial neighbor search (Q6085191) (← links)
- Optimal Seating Assignment in the COVID-19 Era via Quantum Computing (Q6110176) (← links)
- Dynamics of diffusion on monoplex and multiplex networks: a message-passing approach (Q6113816) (← links)
- Quantum annealing to solve the unrelated parallel machine scheduling problem (Q6135480) (← links)
- On optimization problems in acyclic hypergraphs (Q6161450) (← links)
- The max-out min-in problem: a tool for data analysis (Q6164596) (← links)
- Efficient linear reformulations for binary polynomial optimization problems (Q6164618) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)