Building an iterative heuristic solver for a quantum annealer (Q2374373): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1507.07605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic bounds and algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified modeling and solution framework for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 Quadratic programming approach for optimum solutions of two scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new modeling and solution approach for the number partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconstrained quadratic bivalent programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The indefinite zero-one quadratic problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of a quadratic pseudo-Boolean function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound improvement and forcing rule for quadratic binary programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global continuation algorithm for solving binary quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linearization framework for unconstrained quadratic (0-1) problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decompositions for the unconstrained binary quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach for the unconstrained binary quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Memory Tabu Search for Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diversification-driven tabu search for unconstrained binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving unconstrained binary quadratic programming problem by global equilibrium search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic GRASP-tabu search algorithms for the UBQP problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for the unconstrained quadratic pseudo-Boolean function / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary heuristic for quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Method for Quadratic Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minor-embedding in adiabatic quantum computation. I: The parameter setting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path relinking for unconstrained binary quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem / rank
 
Normal rank

Latest revision as of 02:58, 13 July 2024

scientific article
Language Label Description Also known as
English
Building an iterative heuristic solver for a quantum annealer
scientific article

    Statements

    Building an iterative heuristic solver for a quantum annealer (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 December 2016
    0 references
    quantum annealing
    0 references
    quadratic unconstrained binary optimization
    0 references
    combinatoric optimization
    0 references
    \(k\)-opt
    0 references
    local search
    0 references
    iterative heuristic solver
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references