Pages that link to "Item:Q405668"

The following pages link to The unconstrained binary quadratic programming problem: a survey (Q405668):

Displaying 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)
• Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
• Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
• A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
• Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982) (← links)
• Continuous representations and functional extensions in combinatorial optimization (Q508577) (← links)
• A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
• Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
• An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
• A note on xQx as a modelling and solution framework for the linear ordering problem (Q840578) (← links)
• Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
• Analyzing quadratic unconstrained binary optimization problems via multicommodity flows (Q967446) (← 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)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← 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)
• A new approach for modeling and solving set packing problems (Q2462145) (← links)
• Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem (Q2627686) (← 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)
• The application of binary accelerated particle swarm optimization method to unconstrained binary quadratic problems (Q2815852) (← 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)