Building an iterative heuristic solver for a quantum annealer
From MaRDI portal
Publication:2374373
DOI10.1007/s10589-016-9844-yzbMath1357.90090arXiv1507.07605OpenAlexW941393951MaRDI QIDQ2374373
Gili Rosenberg, Mohammad Vazifeh, Eldad Haber, Brad D. Woods
Publication date: 15 December 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.07605
local searchquantum annealingquadratic unconstrained binary optimization\(k\)-optcombinatoric optimizationiterative heuristic solver
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items
Boosting quantum annealer performance via sample persistence ⋮ Models in quantum computing: a systematic review ⋮ Quantum annealing learning search for solving QUBO 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
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- A column generation approach for the unconstrained binary quadratic programming problem
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- 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
- Pseudo-Boolean optimization
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Unconstrained quadratic bivalent programming problem
- Probabilistic bounds and algorithms for the maximum satisfiability problem
- A new modeling and solution approach for the number partitioning problem
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- A linearization framework for unconstrained quadratic (0-1) problems
- A global continuation algorithm for solving binary quadratic programming problems
- Experiments 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
- The maximum clique problem
- Minimization of a quadratic pseudo-Boolean function
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- An evolutionary heuristic for quadratic 0-1 programming
- A unified modeling and solution framework for combinatorial optimization problems
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- Path relinking for unconstrained binary quadratic programming
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- Lower bound improvement and forcing rule for quadratic binary programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- Decomposition Principle for Linear Programs
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- Handbook of Combinatorial Optimization
- A Decomposition Method for Quadratic Zero-One 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
