The unconstrained binary quadratic programming problem: a survey
From MaRDI portal
Publication:405668
DOI10.1007/s10878-014-9734-0zbMath1303.90066MaRDI QIDQ405668
Zhipeng Lü, Mark Lewis, Haibo Wang, Fred Glover, Jin-Kao Hao, Yang Wang, Gary A. Kochenberger
Publication date: 5 September 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9734-0
Related Items
Decision Diagram Decomposition for Quadratically Constrained Binary Optimization, Introduction to QUBO, Applications and Computational Advances for Solving the QUBO Model, Complexity and Polynomially Solvable Special Cases of QUBO, On the Consistent Path Problem, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation, Graph minors from simulated annealing for annealing machines with sparse connectivity, Optimal sufficient requirements on the embedded Ising problem in polynomial time, Optimization via rejection-free partial neighbor search, Optimal Seating Assignment in the COVID-19 Era via Quantum Computing, Dynamics of diffusion on monoplex and multiplex networks: a message-passing approach, Quantum annealing to solve the unrelated parallel machine scheduling problem, On optimization problems in acyclic hypergraphs, The max-out min-in problem: a tool for data analysis, Efficient linear reformulations for binary polynomial optimization problems, On the complexity of binary polynomial optimization over acyclic hypergraphs, Invariants of SDP exactness in quadratic programming, \(f\)-flip strategies for unconstrained binary quadratic programming, Solving the maximum vertex weight clique problem via binary quadratic programming, Continuous representations and functional extensions in combinatorial optimization, Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners, Fractional 0-1 programming: applications and algorithms, Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems, Properties of combinatorial optimization problems over polyhedral-spherical sets, Gaussian mean field lattice gas, The generalized vertex cover problem and some variations, Membership testing for Bernoulli and tail-dependence matrices, Biclustering with a quantum annealer, Embedding equality constraints of optimization problems into a quantum annealer, Shaken dynamics: an easy way to parallel Markov chain Monte Carlo, The variational quantum eigensolver: a review of methods and best practices, Unconstrained binary models of the travelling salesman problem variants for quantum optimization, An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks, Modeling the Costas array problem in QUBO for quantum annealing, Model-based approaches to multi-attribute diverse matching, Structured linear reformulation of binary quadratically constrained quadratic programs, Optimal quadratic reformulations of fourth degree pseudo-Boolean functions, QPLIB: a library of quadratic programming instances, A semi-supervised random vector functional-link network based on the transductive framework, Assortment optimization under the multinomial logit model with product synergies, Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems, Optimization problems involving group sparsity terms, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem, Capping methods for the automatic configuration of optimization algorithms, A review on discrete diversity and dispersion maximization from an OR perspective, Penalty and partitioning techniques to improve performance of QUBO solvers, \texttt{EXPEDIS}: an exact penalty method over discrete sets, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs, Continuous Approaches to the Unconstrained Binary Quadratic Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- On zero duality gap in nonconvex quadratic programming problems
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- A column generation approach for the unconstrained binary quadratic programming problem
- On duality gap in binary quadratic programming
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- Exact solutions to generalized vertex covering problems: a comparison of two models
- The indefinite zero-one quadratic problem
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A hybrid metaheuristic approach to solving the UBQP problem
- Pseudo-Boolean optimization
- Sufficient global optimality conditions for bivalent quadratic optimization
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Algorithms for the maximum satisfiability problem
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Unconstrained quadratic bivalent programming problem
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- A note on xQx as a modelling and solution framework for the linear ordering problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Solving group technology problems via clique partitioning
- A new modeling and solution approach for the number partitioning problem
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Solutions to quadratic minimization problems with box and integer constraints
- New optimality conditions for quadratic optimization problems with binary constraints
- A linearization framework for unconstrained quadratic (0-1) problems
- A global continuation algorithm for solving binary quadratic programming problems
- A solvable case of quadratic 0-1 programming
- Experiments in quadratic 0-1 programming
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- Testing optimality for quadratic 0-1 problems
- The maximum clique problem
- Minimization of a quadratic pseudo-Boolean function
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- An evolutionary heuristic for quadratic 0-1 programming
- Greedy and local search heuristics for unconstrained binary quadratic programming
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- Path relinking for unconstrained binary quadratic programming
- On characterization of maximal independent sets via quadratic optimization
- A new modeling and solution approach for the set-partitioning problem
- An effective modeling and solution approach for the generalized independent set problem
- A new approach for modeling and solving set packing problems
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- Using the unconstrained quadratic program to model and solve Max 2-SAT problems
- Lower bound improvement and forcing rule for quadratic binary programming
- Applications of pseudo-Boolean methods to economic problems
- Clustering of microarray data via clique partitioning
- Graph separation techniques for quadratic zero-one programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
- An algorithm for quadratic zero-one programs
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Methods of Nonlinear 0-1 Programming
- An Efficient Heuristic Procedure for Partitioning Graphs
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- The clique partitioning problem: Facets and patching facets
- Testing optimality for quadratic 0?1 unconstrained problems
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- A Selection Problem of Shared Fixed Costs and Network Flows
- Cluster Analysis and Mathematical Programming
- A branch and bound algorithm for the maximum clique problem
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
