The unconstrained binary quadratic programming problem: a survey
From MaRDI portal
Recommendations
- The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications
- A unified framework for modeling and solving combinatorial optimization problems: a tutorial
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- The application of binary accelerated particle swarm optimization method to unconstrained binary quadratic problems
- Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
Cites work
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 1488074 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A Selection Problem of Shared Fixed Costs and Network Flows
- A branch and bound algorithm for the maximum clique problem
- A column generation approach for the unconstrained binary quadratic programming problem
- A global continuation algorithm for solving binary quadratic programming problems
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- A hybrid metaheuristic approach to solving the UBQP problem
- A linearization framework for unconstrained quadratic (0-1) problems
- A new approach for modeling and solving set packing problems
- A new modeling and solution approach for the number partitioning problem
- A new modeling and solution approach for the set-partitioning problem
- A note on xQx as a modelling and solution framework for the linear ordering problem
- A solvable case of quadratic 0-1 programming
- Adaptive memory tabu search for binary quadratic programs
- Algorithms for the maximum satisfiability problem
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- An Efficient Heuristic Procedure for Partitioning Graphs
- An algorithm for quadratic zero-one programs
- An effective modeling and solution approach for the generalized independent set problem
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- An evolutionary heuristic for quadratic 0-1 programming
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Applications of pseudo-Boolean methods to economic problems
- Cluster Analysis and Mathematical Programming
- Clustering of microarray data via clique partitioning
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Continuous approaches for solving discrete optimization problems
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- Exact solutions to generalized vertex covering problems: a comparison of two models
- Experiments in quadratic 0-1 programming
- Global optimality conditions for quadratic optimization problems with binary constraints
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- Graph separation techniques for quadratic zero-one programming
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- Iterated tabu search for the unconstrained binary quadratic optimization problem
- KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- Lower bound improvement and forcing rule for quadratic binary programming
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- Methods of Nonlinear 0-1 Programming
- Minimization of a quadratic pseudo-Boolean function
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- New optimality conditions for quadratic optimization problems with binary constraints
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- On characterization of maximal independent sets via quadratic optimization
- On duality gap in binary quadratic programming
- On zero duality gap in nonconvex quadratic programming problems
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Path relinking for unconstrained binary quadratic programming
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Pseudo-Boolean optimization
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- Solutions to quadratic minimization problems with box and integer constraints
- Solving group technology problems via clique partitioning
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Sufficient global optimality conditions for bivalent quadratic optimization
- Testing optimality for quadratic 0-1 problems
- Testing optimality for quadratic 0?1 unconstrained problems
- The clique partitioning problem: Facets and patching facets
- The indefinite zero-one quadratic problem
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- The maximum clique problem
- Unconstrained quadratic bivalent programming problem
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Using the unconstrained quadratic program to model and solve Max 2-SAT problems
Cited in
(93)- On the benefits of a new continuous reformulation for QUBO problems
- Transfer learning of optimal QAOA parameters in combinatorial optimization
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization
- QPLIB: a library of quadratic programming instances
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
- A column generation approach for the unconstrained binary quadratic programming problem
- Sampling via Rejection-Free Partial Neighbor Search
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- On the estimate of time complexity of adiabatic calculations on a class of integer lattices
- f-flip strategies for unconstrained binary quadratic programming
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Optimization via rejection-free partial neighbor search
- Applications and computational advances for solving the QUBO model
- A unified framework for modeling and solving combinatorial optimization problems: a tutorial
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- A large population island framework for the unconstrained binary quadratic problem
- Structured linear reformulation of binary quadratically constrained quadratic programs
- Embedding equality constraints of optimization problems into a quantum annealer
- Introduction to QUBO
- The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- A note on xQx as a modelling and solution framework for the linear ordering problem
- Penalty and partitioning techniques to improve performance of QUBO solvers
- Fractional 0-1 programming: applications and algorithms
- Biclustering with a quantum annealer
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Classical computation over quantum architectures. From graph encoding to declarative languages compilation
- Gaussian mean field lattice gas
- Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
- Efficient linear reformulations for binary polynomial optimization problems
- The max-out min-in problem: a tool for data analysis
- Max-flow min-cut theorem in quantum computing
- The generalized vertex cover problem and some variations
- Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation
- Solving the maximum vertex weight clique problem via binary quadratic programming
- Complexity and polynomially solvable special cases of QUBO
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- Modeling the Costas array problem in QUBO for quantum annealing
- Optimization problems involving group sparsity terms
- Optimal Seating Assignment in the COVID-19 Era via Quantum Computing
- Comparing QUBO models for quantum annealing: integer encodings for permutation problems
- New advances for quantum-inspired optimization
- Assortment optimization under the multinomial logit model with product synergies
- Invariants of SDP exactness in quadratic programming
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- Multicommodity information flow through quantum annealer
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Continuous Approaches to the Unconstrained Binary Quadratic Problems
- Graph minors from simulated annealing for annealing machines with sparse connectivity
- Optimal sufficient requirements on the embedded Ising problem in polynomial time
- Curve fitting on a quantum annealer for an advanced navigation method
- The application of binary accelerated particle swarm optimization method to unconstrained binary quadratic problems
- A hybrid metaheuristic approach to solving the UBQP problem
- Path relinking for unconstrained binary quadratic programming
- A finite state automaton for quantum computing
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- Evaluating the practicality of quantum optimization algorithms for prototypical industrial applications
- Model-based approaches to multi-attribute diverse matching
- A review on discrete diversity and dispersion maximization from an OR perspective
- Membership testing for Bernoulli and tail-dependence matrices
- Adaptive randomization in network data
- Distributed quantum generalized benders decomposition for unit commitment problems
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
- On the consistent path problem
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- Penalty-enhanced quantum approximate optimization algorithm framework for maximization and minimization problems
- On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
- Capping methods for the automatic configuration of optimization algorithms
- On optimization problems in acyclic hypergraphs
- New approach to solve unconstrained binary quadratic problem
- Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis
- A semi-supervised random vector functional-link network based on the transductive framework
- Random unconditional convergence of Rademacher chaos in L_ and sharp estimates for discrepancy of weighted graphs and hypergraphs
- Continuous representations and functional extensions in combinatorial optimization
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- Technique for transforming discrete optimization problems into QUBO form
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- A new approach for modeling and solving set packing problems
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Quantum annealing to solve the unrelated parallel machine scheduling problem
- Shaken dynamics: an easy way to parallel Markov chain Monte Carlo
- Enhanced open-source scatter search algorithm for solving quadratic unconstrained binary optimization problems
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- Dynamics of diffusion on monoplex and multiplex networks: a message-passing approach
- Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
- Bivalent quadratic optimization with sum-of-square of quadratic penalties
- The variational quantum eigensolver: a review of methods and best practices
- A review on quantum approximate optimization algorithm and its variants
This page was built for publication: The unconstrained binary quadratic programming problem: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405668)
